Ore-type graph packing problems
From MaRDI portal
Publication:3429747
DOI10.1017/S0963548306007899zbMath1122.05081MaRDI QIDQ3429747
Gexin Yu, Alexandr V. Kostochka
Publication date: 20 March 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (11)
A QUESTION ON RELAXED EQUITABLE COLORING ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Graphs containing every 2-factor ⋮ A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ An Ore-type theorem on equitable coloring ⋮ A fast algorithm for equitable coloring ⋮ Ore-type versions of Brooks' theorem ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Embedding Graphs Having Ore-Degree at Most Five
This page was built for publication: Ore-type graph packing problems
