DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2,
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
DM
2002
13 years 4 months ago
2002
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer r...
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
For every nonnegative integer arc weight function
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...