Graph decomposition with constraints in the minimum degree

DOI10.1016/0012-365X(88)90122-7zbMath0644.05030OpenAlexW2167211542MaRDI QIDQ1102305

John Sheehan

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90122-7

zbMATH Keywords

minimum degreegraph decompositiondense sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

A note on partitions of graphs under degree constraints ⋮ Approximation of satisfactory bisection problems ⋮ Balanced graphs with minimum degree constraints ⋮ Satisfactory graph partition, variants, and generalizations ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ Graph partitions with minimum degree constraints ⋮ Graphical decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partition of graphs with condition on the connectivity and minimum degree
• Graph decompositions without isolates
• Size Ramsey numbers involving stars
• Vertex colorings without isolates
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Subdivisions of graphs with large minimum degree
• Graph decomposition with constraints on the connectivity and minimum degree
• Graph decomposition with applications to subdivisions and path systems modulo k
• Cycles Modulo k
• A homology theory for spanning tress of a graph