|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2012, Volume 9, Pages 156–160
(Mi semr345)
|
|
|
|
Discrete mathematics and mathematical cybernetics
On a question of Dirac on critical and vertex critical graphs
Tommy Jensen, Mark Siggers College of Natural Sciences,
Kyungpook National University,
Daegu 702-701, South Korea
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 $cn^2$ 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 $\varepsilon>0$ we get $4$-vertex-critical graphs in which less than an $\varepsilon$-proportion of the edges are non-critical.
Keywords:
critical graph, vertex-criticality, critical edge, Dirac problem.
Received February 3, 2012, published February 21, 2012
Citation:
Tommy Jensen, Mark Siggers, “On a question of Dirac on critical and vertex critical graphs”, Sib. Èlektron. Mat. Izv., 9 (2012), 156–160
Linking options:
https://www.mathnet.ru/eng/semr345 https://www.mathnet.ru/eng/semr/v9/p156
|
Statistics & downloads: |
Abstract page: | 53 | Full-text PDF : | 18 | References: | 23 |
|