Optimal Vertex Partitions

DOI10.1112/blms/11.2.113zbMath0423.05021OpenAlexW2041913214MaRDI QIDQ3856792

Béla Bollobás, Bennet Manvel

Publication date: 1979

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/11.2.113

zbMATH Keywords

decompositionBrooks' theoremk-degenate graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ Brooks' Theorem and Beyond ⋮ Partitions of hypergraphs under variable degeneracy constraints ⋮ Partitioning into degenerate graphs in linear time ⋮ Generalized DP-colorings of graphs ⋮ Partitioning of a graph into induced subgraphs not containing prescribed cliques ⋮ Sparse Graphs Are Near-Bipartite ⋮ Critically partitionable graphs. II ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs ⋮ Cover and variable degeneracy ⋮ Point partition numbers: perfect graphs

This page was built for publication: Optimal Vertex Partitions