On uniquely partitionable planar graphs

DOI10.1016/S0012-365X(98)00102-2zbMath0957.05029OpenAlexW2081899314MaRDI QIDQ1584417

Peter Mihók, Jozef Bucko, Margit Voigt

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00102-2

zbMATH Keywords

partitionhereditary propertiesuniquely partitionable planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the order of uniquely (k,m)-colourable graphs
• Critically partitionable graphs. II
• Extremal results on defective colorings of graphs
• Uniquely k-arborable graphs
• On the structure of hereditary classes of graphs
• Uniquely Partitionable Graphs
• Uniquely colorable graphs
• On uniquely colorable planar graphs
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item