Pages that link to "Item:Q5295501"
From MaRDI portal
The following pages link to Vertex partitions and maximum degenerate subgraphs (Q5295501):
Displaying 9 items.
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Partitioning into degenerate graphs in linear time (Q6080366) (← links)
- Dirac's theorem on chordal graphs implies Brooks' theorem (Q6136675) (← links)