On uniquely partitionable planar graphs
From MaRDI portal
Publication:1584417
DOI10.1016/S0012-365X(98)00102-2zbMATH Open0957.05029OpenAlexW2081899314MaRDI QIDQ1584417FDOQ1584417
Authors: 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
Recommendations
- Uniquely partitionable planar graphs with respect to properties having a forbidden tree
- Unique factorization theorem
- Uniquely partitionable graphs
- Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties
- The order of uniquely partitionable graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- 25 pretty graph colouring problems
- Title not available (Why is that?)
- Uniquely colorable graphs
- On uniquely colorable planar graphs
- Extremal results on defective colorings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniquely Partitionable Graphs
- On the order of uniquely (k,m)-colourable graphs
- On the structure of hereditary classes of graphs
- Uniquely k-arborable graphs
- Title not available (Why is that?)
- Critically partitionable graphs. II
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the closed partition of a planar graph
- Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties
- Title not available (Why is that?)
- \(\gamma\)-chromatic partition in planar graph characterization
This page was built for publication: On uniquely partitionable planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584417)
