Pages that link to "Item:Q2011133"

The following pages link to Partitioning a graph into degenerate subgraphs (Q2011133):

Displaying 10 items.

• Decomposition of a graph into two disjoint odd subgraphs (Q1756121) (← links)
• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
• Partitioning graphs into induced subgraphs (Q2283104) (← links)
• Decomposing a graph into two subgraphs with prescribed parities of vertex degrees (Q2286313) (← links)
• Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
• Vertex partitions and maximum degenerate subgraphs (Q5295501) (← links)
• (Q5752607) (← links)
• Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
• Partitioning into degenerate graphs in linear time (Q6080366) (← links)
• The high order spectrum of a graph and its applications in graph colouring and clique counting (Q6133767) (← links)