Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The structure of k-chromatic graphs - MaRDI portal

The structure of k-chromatic graphs

From MaRDI portal
Publication:5821654

DOI10.4064/fm-40-1-42-55zbMath0053.13102OpenAlexW946274330MaRDI QIDQ5821654

G. A. Dirac

Publication date: 1953

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213329




Related Items

A Uniform Set Covering LemmaDie graphentheoretische Lösung eines nichtlinearen ZuteilungsproblemsSize, chromatic number, and connectivityPoint partition numbers: decomposable and indecomposable critical graphsHadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphsAn analogue of Dirac's theorem on circular super-critical graphsOn constructive methods in the theory of colour-critical graphsThe minimum number of edges in 4-critical digraphs of given orderStructure in sparse \(k\)-critical graphsOn color critical graphs with large adaptable chromatic numbersGeneralized DP-colorings of graphsGraphs with chromatic number close to maximum degreeGraphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivisionColoring Graphs with Two Odd Cycle LengthsGeneralized hypergraph coloringPartitioning sparse graphs into an independent set and a forest of bounded degreeA Brooks type theorem for the maximum local edge connectivityA practical approach to the chromatic partition problemA Brooks-type result for sparse critical graphsHadwiger's conjecture for 3-arc graphsPlanar 4-critical graphs with four trianglesA characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theoremOn critical subgraphs of colour-critical graphsCounting critical subgraphs in \(k\)-critical graphsOn separating sets of edges in contraction-critical graphsBemerkungen zu Hadwigers VermutungColour-critical graphs and hypergraphsThe dichromatic number of a digraphTomescu's Graph Coloring Conjecture for $\ell$-Connected GraphsOn list critical graphsImmersion and clustered coloring