On uniquely partitionable planar graphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3910413 (Why is no real title available?)
- scientific article; zbMATH DE number 4010565 (Why is no real title available?)
- scientific article; zbMATH DE number 4021173 (Why is no real title available?)
- scientific article; zbMATH DE number 3470444 (Why is no real title available?)
- scientific article; zbMATH DE number 3482395 (Why is no real title available?)
- 25 pretty graph colouring problems
- Critically partitionable graphs. II
- Extremal results on defective colorings of graphs
- On the order of uniquely (k,m)-colourable graphs
- On the structure of hereditary classes of graphs
- On uniquely colorable planar graphs
- Uniquely Partitionable Graphs
- Uniquely colorable graphs
- Uniquely k-arborable graphs
Cited in
(7)- scientific article; zbMATH DE number 6125173 (Why is no real title available?)
- scientific article; zbMATH DE number 1882351 (Why is no real title available?)
- scientific article; zbMATH DE number 4101215 (Why is no real title available?)
- Finding the closed partition of a planar graph
- Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties
- scientific article; zbMATH DE number 1536524 (Why is no real title available?)
- \(\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)
