547 search results - page 56 / 110 » dm 2008 |
102
click to vote
DM
2002
15 years 23 days 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
15 years 23 days 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
15 years 23 days 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
15 years 23 days ago
2002
We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...
DM
2002
15 years 23 days ago
2002
An approach to the computations of upper bounds on the size of large complete arcs is presented. In particular, we obtain geometrical properties of irreducible envelopes associated...