Embedding Arbitrary Graphs of Maximum Degree Two
From MaRDI portal
Publication:4289355
DOI10.1112/jlms/s2-48.1.39zbMath0796.05029OpenAlexW2083188650MaRDI QIDQ4289355
No author found.
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
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Disjoint Cycles in a Digraph with Partial Degree ⋮ Triangles in randomly perturbed graphs ⋮ Toughness, degrees and 2-factors ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Cycles of Given Size in a Dense Graph ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Disjoint directed cycles with specified lengths in directed bipartite graphs ⋮ 2-universality in randomly perturbed graphs ⋮ Graphs containing every 2-factor ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Disjoint directed cycles in directed graphs ⋮ Packing two graphs of even girth 10 ⋮ Hamiltonian cycles with all small even chords ⋮ Fan-type condition on disjoint cycles in a graph ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Packing \(d\)-degenerate graphs ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ On a graph packing conjecture by Bollobás, Eldridge and Catlin ⋮ On the Bollobás–Eldridge Conjecture for Bipartite Graphs ⋮ Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs ⋮ On the relation of separability, bandwidth and embedding ⋮ Packing Graphs of Bounded Codegree ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Partial Degree Conditions and Cycle Coverings ⋮ Cycle factors in dense graphs ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Unnamed Item ⋮ Embedding Graphs Having Ore-Degree at Most Five
