scientific article
From MaRDI portal
Publication:3656238
zbMath1182.05064MaRDI QIDQ3656238
Gexin Yu, Alexandr V. Kostochka, Henry A. Kierstead
Publication date: 13 January 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Graphs with chromatic number close to maximum degree ⋮ A note on relaxed equitable coloring of graphs ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A refinement of a result of Corrádi and Hajnal ⋮ The Turán number of sparse spanning graphs ⋮ Embedding Graphs Having Ore-Degree at Most Five ⋮ On the bipartite graph packing problem
This page was built for publication:
