Critically partitionable graphs. II

DOI10.1016/0012-365X(82)90083-8MaRDI QIDQ1168331zbMATH OpenFDO

Authors Andrew 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

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

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3482395 (Why is no real title available?)
• scientific article; zbMATH DE number 3517211 (Why is no real title available?)
• k-Degenerate Graphs
• An extension of Brooks' theorem to n-degenerate graphs
• Critical Point-Arboritic Graphs
• Graph Theory and Probability
• Optimal Vertex Partitions
• The Point-Arboricity of Planar Graphs
• Uniquely Colourable Graphs with Large Girth
• Uniquely Partitionable Graphs

Cited in

(2)

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

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

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