Partitioning a graph into two square-cycles

From MaRDI portal

Revision as of 20:26, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4715278

Jump to:navigation, search

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<241::AID-JGT4>3.0.CO;2-S" /><241::AID-JGT4>3.0.CO;2-S 10.1002/(SICI)1097-0118(199611)23:3<241::AID-JGT4>3.0.CO;2-SzbMath0859.05055OpenAlexW4231960493MaRDI QIDQ4715278

Henry A. Kierstead, Geng-Hua Fan

Publication date: 16 December 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<241::aid-jgt4>3.0.co;2-s

zbMATH Keywords

cycle minimum degree powers of graphs Pósa conjecture square-cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

On a degree sequence analogue of Pósa's conjecture ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Square Hamiltonian cycles in graphs with maximal 4-cliques ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Pósa's conjecture for graphs of order at least 2 × 10⁸ ⋮ How to avoid using the regularity Lemma: Pósa's conjecture revisited

This page was built for publication: Partitioning a graph into two square-cycles

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4715278&oldid=18953643"