On the structure of 5- and 6-chromatic abstract graphs.

From MaRDI portal
Publication:5340529

DOI10.1515/crll.1964.214-215.43zbMath0131.38403OpenAlexW4235503239MaRDI QIDQ5340529

G. A. Dirac

Publication date: 1964

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002180413




Related Items (22)

Point partition numbers: decomposable and indecomposable critical graphsOn the connectivity of minimum and minimal counterexamples to Hadwiger's conjectureHadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphsOn constructive methods in the theory of colour-critical graphsSome recent progress and applications in graph minor theoryConjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs)Partitioning sparse graphs into an independent set and a forest of bounded degreeA Brooks type theorem for the maximum local edge connectivityColor-critical graphs have logarithmic circumferenceSome remarks on the chromatic index of a graphPlanar 4-critical graphs with four trianglesZur Klassifikation der endlichen Graphen nach H. Hadwiger und K. WagnerHomomorphiesätze für GraphenHomomorphieeigenschaften und mittlere Kantendichte von GraphenHadwiger's conjecture for proper circular arc graphsOn critical subgraphs of colour-critical graphsLinear connectivity forces large complete bipartite minorsCounting critical subgraphs in \(k\)-critical graphsOn separating sets of edges in contraction-critical graphsEvery orientation of a 4-chromatic graph has a non-bipartite acyclic subgraphColour-critical graphs and hypergraphsTools for counting odd cycles in graphs






This page was built for publication: On the structure of 5- and 6-chromatic abstract graphs.