Optimal Vertex Partitions

DOI10.1112/BLMS/11.2.113zbMATH Open0423.05021OpenAlexW2041913214MaRDI QIDQ3856792FDOQ3856792

Authors: 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)

Cited In (15)

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

This page was built for publication: Optimal Vertex Partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856792)