Critically partitionable graphs. II

DOI10.1016/0012-365X(82)90083-8zbMATH Open0493.05028MaRDI QIDQ1168331FDOQ1168331

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Theory and Probability
• The Point-Arboricity of Planar Graphs
• k-Degenerate Graphs
• Critical Point-Arboritic Graphs
• Uniquely Colourable Graphs with Large Girth
• An extension of Brooks' theorem to n-degenerate graphs
• Uniquely Partitionable Graphs
• Optimal Vertex Partitions

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)