On constructive methods in the theory of colour-critical graphs

DOI10.1016/0012-365X(89)90210-0zbMATH Open0675.05028MaRDI QIDQ1121899FDOQ1121899

Authors: Horst Sachs, Michael Stiebitz 

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• On the construction of cograph color critical graphs
• scientific article; zbMATH DE number 3924804
• On color critical graphs
• scientific article; zbMATH DE number 5546
• scientific article; zbMATH DE number 4168720
• Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
• scientific article; zbMATH DE number 5631913
• On complete subgraphs of color-critical graphs
• scientific article; zbMATH DE number 3979084
• scientific article; zbMATH DE number 3891399

zbMATH Keywords

chromatic numberk-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Sur le coloriage des graphs
• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• Kneser's conjecture, chromatic number, and homotopy
• Applications of product colouring
• Three short proofs in graph theory
• The dichromatic number of a digraph
• Title not available (Why is that?)
• Title not available (Why is that?)
• On color critical graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
• Map Colour Theorems Related To the Heawood Colour Formula
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The structure of k-chromatic graphs
• On coloring graphs with locally small chromatic number
• On colorings of graphs without short cycles
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paths and Circuits in Critical Graphs
• Title not available (Why is that?)
• \(K_ 5\) is the only double-critical 5-chromatic graph
• Circuits in critical graphs
• Maximal Circuits in Critical Graphs
• On the structure of 5- and 6-chromatic abstract graphs.
• Title not available (Why is that?)
• Excess in critical graphs
• The number of edges in critical graphs.
• On critical subgraphs of colour-critical graphs
• Title not available (Why is that?)
• An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
• Title not available (Why is that?)
• Title not available (Why is that?)
• 4‐chrome Graphen und vollständige 4‐Graphen
• Colour-critical graphs and hypergraphs
• Title not available (Why is that?)
• Subgraphs of colour-critical graphs
• Note to a problem of T. Gallai and G. A. Dirac
• Title not available (Why is that?)
• Sur les Ensembles de Sommets Indépendants Dans les Graphes Chromatiques Minimaux
• Title not available (Why is that?)
• Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Map Colour Theorems Related to the Heawood Colour Formula (II)
• Title not available (Why is that?)
• On the Girth of Graphs Critical with Respect to Edge-Colourings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theorems Related To the Four Colour Conjecture

Cited In (27)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On graphs with strongly independent color-classes
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Edge-critical subgraphs of Schrijver graphs. II: The general case
• Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge
• A note on \(\Delta\)-critical graphs
• Title not available (Why is that?)
• Critically paintable, choosable or colorable graphs
• Generalizations of independence and chromatic numbers of a graph
• Ore's conjecture on color-critical graphs is almost true
• A blow-up construction and graph coloring
• Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs
• Title not available (Why is that?)
• Problems and results in extremal combinatorics. I.
• A note on the immersion number of generalized Mycielski graphs
• Questions on color-critical subgraphs
• On the minimal number of edges in color-critical graphs
• Small odd cycles in 4-chromatic graphs
• 4-chromatic graphs with large odd girth
• On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs
• Title not available (Why is that?)
• On extensions of a conjecture of Gallai
• Generalised Mycielski graphs and the Borsuk-Ulam theorem
• Title not available (Why is that?)
• \(S\)-packing chromatic vertex-critical graphs

This page was built for publication: On constructive methods in the theory of colour-critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121899)