A note on embedding graphs without short cycles

DOI10.1016/J.DISC.2003.11.048MaRDI QIDQ1883254zbMATH OpenOpenAlexFDO

Authors Monika Pilśniak, Mariusz Woźniak, Irmina A. Zioło, Agnieszka Görlich

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)

Recommendations

• scientific article; zbMATH DE number 426373
• The Erdős-Sós conjecture for graphs whose complements contain no C₄
• scientific article; zbMATH DE number 861401
• Graphs without proper subgraphs of minimum degree 3 and short cycles
• A note on packing graphs without cycles of length up to five

Cites work

• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• scientific article; zbMATH DE number 426373 (Why is no real title available?)
• scientific article; zbMATH DE number 861401 (Why is no real title available?)
• On cyclically embeddable graphs

Cited in

(12)

• Pushing vertices in digraphs without long induced cycles
• Sparse graphs of girth at least five are packable
• A note on graphs without short even cycles
• Packing three copies of a tree into its sixth power
• A note on packing graphs without cycles of length up to five
• scientific article; zbMATH DE number 426373 (Why is no real title available?)
• Note on graphs without repeated cycle lengths
• Bipacking a bipartite graph with girth at least 12
• scientific article; zbMATH DE number 861401 (Why is no real title available?)
• On a conjecture of embeddable graphs
• Unstable graphs and packing into fifth power
• Proof of a packing conjecture of bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883254)