A note on embedding graphs without short cycles

DOI10.1016/j.disc.2003.11.048zbMath1048.05029OpenAlexW1967546415MaRDI QIDQ1883254

Mariusz Woźniak, Irmina A. Zioło, Monika Pilśniak, Agnieszka Goerlich

Publication date: 1 October 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.048

zbMATH Keywords

CyclesEmbedding of graphsEmbedding without fixed points

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Packing three copies of a tree into its sixth power ⋮ Sparse graphs of girth at least five are packable ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• On cyclically embeddable graphs

This page was built for publication: A note on embedding graphs without short cycles