Embedding Arbitrary Graphs of Maximum Degree Two

DOI10.1112/JLMS/S2-48.1.39zbMATH Open0796.05029OpenAlexW2083188650MaRDI QIDQ4289355FDOQ4289355

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

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

zbMATH Keywords

embeddingpackingconjecture of Bollabás and Eldridge

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)

Cited In (43)

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

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)