Critically partitionable graphs. II

DOI10.1016/0012-365X(82)90083-8zbMath0493.05028MaRDI QIDQ1168331

Andrew G. Thomason

Publication date: 1982

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

zbMATH Keywords

chromatic numberk-degenerate graphuniquely (m,k)-partitionable

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (2)

Point partition numbers: decomposable and indecomposable critical graphs ⋮ On uniquely partitionable planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension of Brooks' theorem to n-degenerate graphs
• Graph Theory and Probability
• Optimal Vertex Partitions
• Critical Point-Arboritic Graphs
• Uniquely Colourable Graphs with Large Girth
• Uniquely Partitionable Graphs
• The Point-Arboricity of Planar Graphs
• k-Degenerate Graphs

This page was built for publication: Critically partitionable graphs. II