The following pages link to Optimal Vertex Partitions (Q3856792):
Displayed 15 items.
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Critically partitionable graphs. II (Q1168331) (← links)
- Injective edge-coloring of graphs with given maximum degree (Q2033899) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Partitioning into degenerate graphs in linear time (Q6080366) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)