On invariants of hereditary graph properties

DOI10.1016/j.disc.2005.11.048zbMath1116.05031OpenAlexW1964117141MaRDI QIDQ868369

Peter Mihók, Gabriel Semanisin

Publication date: 2 March 2007

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

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

zbMATH Keywords

reducibilitymonotone graph invariant

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning graphs of bounded tree-width
• Minimal reducible bounds for induced-hereditary properties
• Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
• Minimal forbidden subgraphs of reducible graph properties
• Saturated graphs with minimal number of edges
• A survey of hereditary properties of graphs
• 25 pretty graph colouring problems
• Minimal reducible bounds for the class of \(k\)-degenerate graphs

This page was built for publication: On invariants of hereditary graph properties