scientific article; zbMATH DE number 4010565
From MaRDI portal
Publication:3760581
Recommendations
Cited in
(15)- On uniquely partitionable planar graphs
- Path partitioning planar graphs of girth 4 without adjacent short cycles
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Minimal reducible bounds for induced-hereditary properties
- Path partitioning planar graphs with restrictions on short cycles
- A characterization and hereditary properties for partition graphs
- Unique factorization of compositive hereditary graph properties
- The decomposability of additive hereditary properties of graphs
- Hereditarily equivalent graph properties
- The property of \(k\)-colourable graphs is uniquely decomposable
- A survey of hereditary properties of graphs
- scientific article; zbMATH DE number 2109749 (Why is no real title available?)
- Partition of a planar graph with girth 6 into two forests with chain length at most 4
- scientific article; zbMATH DE number 2230277 (Why is no real title available?)
- scientific article; zbMATH DE number 2230304 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760581)