Name
Abstract | ||
|---|---|---|
Erdos and Lovasz conjectured in 1968 that for every graph G with @g(G)@w(G) and any two integers s,t=2 with s+t=@g(G)+1, there is a partition (S,T) of the vertex set V(G) such that @g(G[S])=s and @g(G[T])=t. Except for a few cases, this conjecture is still unsolved. In this note we prove the conjecture for quasi-line graphs and for graphs with independence number 2. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.11.016 | Discrete Mathematics |
Keywords | Field | DocType |
double-critical graphs,quasi-line graphs,graph coloring,independence number,graphs,line graph,discrete mathematics | Integer,Discrete mathematics,Graph,Combinatorics,Line graph,Vertex (geometry),Partition (number theory),Conjecture,Mathematics,Critical graph,Graph coloring | Journal |
Volume | Issue | ISSN |
309 | 12 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.53 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| József Balogh | 1 | 862 | 89.91 |
| Alexandr V. Kostochka | 2 | 682 | 89.87 |
| Noah Prince | 3 | 74 | 9.02 |
| Michael Stiebitz | 4 | 207 | 30.08 |