Minimal reducible bounds for induced-hereditary properties

DOI10.1016/j.disc.2003.11.058zbMath1055.05065OpenAlexW2090124461MaRDI QIDQ1883266

Gabriel Semanisin

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.058

zbMATH Keywords

Partial \(k\)-treeOuterplanar graph\(k\)-Degenerate graphInduced-hereditary property of graphsMinimal reducible bound

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On invariants of hereditary graph properties ⋮ Some bounds on the generalised total chromatic number of degenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning graphs of bounded tree-width
• Minimal reducible bounds in the lattice of additive hereditary graph properties
• On the minimal reducible bound for outerplanar and planar graphs
• Minimal reducible bounds for planar graphs
• Graphs with forbidden subgraphs
• Hereditary properties of raphs
• A survey of hereditary properties of graphs
• Minimal reducible bounds for hom-properties of graphs
• Generalized Ramsey theory and decomposable properties of graphs
• Unique factorization theorem
• Unique factorisation of additive induced-hereditary properties
• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
• Colour Classes for r-Graphs
• 25 pretty graph colouring problems
• Minimal reducible bounds for the class of \(k\)-degenerate graphs

This page was built for publication: Minimal reducible bounds for induced-hereditary properties