Embedding Arbitrary Graphs of Maximum Degree Two

DOI10.1112/JLMS/S2-48.1.39MaRDI QIDQ4289355zbMATH OpenOpenAlexFDO

Authors

Publication date 3 May 1994

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

Full work available at URL https://doi.org/10.1112/jlms/s2-48.1.39

zbMATH Keywords

conjecture of Bollabás and Eldridgeembeddingpacking

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Packing two copies of a sparse graph into a graph with restrained maximum degree
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• Packing graphs of bounded codegree

Cited in

(46)

• Triangle packings and 1-factors in oriented graphs
• Ore-type conditions implying 2-factors consisting of short cycles
• Cycle factors in dense graphs
• Packing two graphs of even girth 10
• Fan-type condition on disjoint cycles in a graph
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Toughness, degrees and 2-factors
• Graphs containing every 2-factor
• On embedding graphs with bounded sum of size and maximum degree
• Disproofs of two conjectures on no hole anti-n-labeling of graphs
• 2-universality in randomly perturbed graphs
• Disjoint directed cycles in directed graphs
• Packing a number of copies of a \(( p , q )\)-graph
• On the relation of separability, bandwidth and embedding
• Packing \(d\)-degenerate graphs
• Disjoint directed cycles with specified lengths in directed bipartite graphs
• A greedy algorithm for the social golfer and the Oberwolfach problem
• Embedding of graphs in two-irregular graphs
• On degree sequences forcing the square of a Hamilton cycle
• Embedding graphs having Ore-degree at most five
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• Cycles of Given Size in a Dense Graph
• scientific article; zbMATH DE number 4156463 (Why is no real title available?)
• An Ore-type theorem on Hamiltonian square cycles
• Packing two copies of a sparse graph into a graph with restrained maximum degree
• Hamiltonian cycles with all small even chords
• scientific article; zbMATH DE number 7021376 (Why is no real title available?)
• Packing graphs of bounded codegree
• Partial Degree Conditions and Cycle Coverings
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• Disjoint Cycles in a Digraph with Partial Degree
• Triangles in randomly perturbed graphs
• Partial degrees on matchings for cycles in bipartite graphs
• The square of a Hamilton cycle in randomly perturbed graphs
• Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
• A robust Corrádi-Hajnal theorem
• On uniqueness of packing of three copies of 2-factors
• A generalization of the graph packing theorems of Sauer-Spencer and Brandt
• Clique factors in pseudorandom graphs
• Combinatorics. Abstracts from the workshop held January 4--9, 2026
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• On embedding well-separable graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• On a graph packing conjecture by Bollobás, Eldridge and Catlin

This page was built for publication: Embedding Arbitrary Graphs of Maximum Degree Two

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