Optimal Vertex Partitions

DOI10.1112/BLMS/11.2.113MaRDI QIDQ3856792zbMATH OpenOpenAlexFDO

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

Brooks' theoremdecompositionk-degenate graphs

Mathematics Subject Classification ID

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

Cited in

(16)

• Critically partitionable graphs. II
• Injective edge-coloring of graphs with given maximum degree
• Cover and variable degeneracy
• Point partition numbers: perfect graphs
• 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
• Vertex partition of hypergraphs and maximum degenerate subhypergraphs
• Sparse graphs are near-bipartite
• 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
• Brooks-type colourings of digraphs in linear time
• Satisfactory graph partition, variants, and generalizations

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)