Vertex partitions and maximum degenerate subgraphs

DOI10.1002/jgt.20235zbMath1125.05084OpenAlexW4244487191MaRDI QIDQ5295501

Martin Matamala

Publication date: 30 July 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20235

zbMATH Keywords

vertex partitiondegenerate subgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ Partitioning into degenerate graphs in linear time ⋮ Dirac's theorem on chordal graphs implies Brooks' theorem ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs ⋮ A Reconfigurations Analogue of Brooks' Theorem and Its Consequences ⋮ Recognizing Graphs Close to Bipartite Graphs

Cites Work

• k-Degenerate Graphs

This page was built for publication: Vertex partitions and maximum degenerate subgraphs