Abstract
We give a construction which for any N provides a graph on n > N vertices which is vertex-critical with respect to being 4-chromatic, has at least cn2 edges that are non-critical (i.e., the removal of any one does not change the chromaticity) and has at most Cn critical edges for some fixed positive constants c and C. Thus for any ε > 0 we get 4-vertex-critical graphs in which less than an ε-proportion of the edges are non-critical.
Original language | English |
---|---|
Pages (from-to) | 156-160 |
Number of pages | 5 |
Journal | Siberian Electronic Mathematical Reports |
Volume | 9 |
Issue number | 1 |
State | Published - 2012 |
Keywords
- Critical edge
- Critical graph
- Dirac problem
- Vertex-criticality