Minimal reducible bounds for the class of \(k\)-degenerate graphs

DOI10.1016/S0012-365X(00)00447-7zbMath0995.05073OpenAlexW1969216473MaRDI QIDQ5959107

Peter Mihók

Publication date: 20 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00447-7

zbMATH Keywords

partition\(k\)-degenerate graphscovering setminimal reducible bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (6)

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Minimal reducible bounds for induced-hereditary properties ⋮ On invariants of hereditary graph properties ⋮ Some bounds on the generalised total chromatic number of degenerate graphs ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ A Reconfigurations Analogue of Brooks' Theorem and Its Consequences

This page was built for publication: Minimal reducible bounds for the class of \(k\)-degenerate graphs