Covering the vertex set of a graph with subgraphs of smaller degree

DOI10.1016/0012-365X(78)90147-4zbMath0371.05024MaRDI QIDQ1243281

James F. Lawrence

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Combinatorial aspects of packing and covering (05B40)

Related Items

New upper bounds for the chromatic number of a graph, On Brooks' Theorem for Sparse Graphs, A note on Reed's conjecture for triangle-free graphs, On triangle-free list assignments, Randomly colouring graphs (a combinatorial view), Heuristics for automated knowledge source integration and service composition, Destroying Noncomplete Regular Components in Graph Partitions, Satisfactory graph partition, variants, and generalizations, On a theorem about vertex colorings of graphs, Graph theory (algorithmic, algebraic, and metric problems), Another bound on the chromatic number of a graph, Coloring Sparse Hypergraphs, Distributed coloring algorithms for triangle-free graphs

Cites Work

• Solutions of irreflexive relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item