Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs

DOI10.1007/BF01192519zbMath0844.05052OpenAlexW1996583025MaRDI QIDQ1906843

H. L. Abbott, Bing Zhou

Publication date: 13 February 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192519

zbMATH Keywords

chromatic numbernumber of subgraphscritical graph

Mathematics Subject Classification ID

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

Related Items (2)

Counting critical subgraphs in \(k\)-critical graphs ⋮ Tools for counting odd cycles in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On critical subgraphs of colour-critical graphs
• Subgraphs of colour-critical graphs
• On constructive methods in the theory of colour-critical graphs
• A short proof of Minc's conjecture
• The maximum number of Hamiltonian paths in tournaments
• Some Theorems on Abstract Graphs
• Paths and Circuits in Critical Graphs

This page was built for publication: Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs