Colour-critical graphs and hypergraphs

DOI10.1016/0095-8956(74)90057-4MaRDI QIDQ2563172zbMATH OpenOpenAlexFDO

Authors Bjarne Toft

Publication date 1974

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(74)90057-4

Mathematics Subject Classification ID

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

Cites work

• B-sets and coloring problems
• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3279789 (Why is no real title available?)
• scientific article; zbMATH DE number 3304760 (Why is no real title available?)
• scientific article; zbMATH DE number 3327126 (Why is no real title available?)
• scientific article; zbMATH DE number 3358507 (Why is no real title available?)
• scientific article; zbMATH DE number 3361909 (Why is no real title available?)
• scientific article; zbMATH DE number 3195967 (Why is no real title available?)
• On A Combinatorial Problem of Erdös
• On chromatic number of finite set-systems
• On chromatic number of graphs and set-systems
• On odd circuits in chromatic graphs
• On separating sets of edges in contraction-critical graphs
• On the structure of 5- and 6-chromatic abstract graphs.
• Paths and Circuits in Critical Graphs
• Self-dual configurations and regular graphs
• The structure of k-chromatic graphs

Cited in

(23)

• Subgraphs of colour-critical graphs
• On constructive methods in the theory of colour-critical graphs
• The enumeration problem for color critical linear hypergraphs
• Critical hypergraphs for the weak chromatic number
• Graph properties and hypergraph colourings
• A vertex critical graph without critical edges
• On the minimal number of edges in color-critical graphs
• On the colorability of \(m\)-composed graphs
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• A Brooks type theorem for the maximum local edge connectivity
• Restraints permitting the largest number of colourings
• The complexity of generalized graph colorings
• Concepts on coloring of cluster hypergraphs with application
• Complete colourings of hypergraphs
• A list version of Dirac's theorem on the number of edges in colour-critical graphs
• THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number
• A broken cycle theorem for the restrained chromatic function
• Amenable colorings
• A note on \(\Delta\)-critical graphs
• Coloring hypergraphs with excluded minors
• Sparse colour-critical hypergraphs
• Graph coloring satisfying restraints

This page was built for publication: Colour-critical graphs and hypergraphs

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