Cycle factors in dense graphs
From MaRDI portal
Publication:1292839
DOI10.1016/S0012-365X(99)90079-1zbMath0930.05071OpenAlexW4212784735MaRDI QIDQ1292839
Publication date: 30 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90079-1
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
[https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- On circuits in graphs
- Almost \(H\)-factors in dense graphs
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Blow-up lemma
- 2-factors in dense graphs
- \(H\)-factors in dense graphs
- An algorithmic version of the blow-up lemma
- [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
- Embedding Arbitrary Graphs of Maximum Degree Two
- The Algorithmic Aspects of the Regularity Lemma
- Covering a graph with cycles
- Proof of a Packing Conjecture of Bollobás
- On the maximal number of independent circuits in a graph
This page was built for publication: Cycle factors in dense graphs
