On cyclically embeddable (n,n)-graphs

DOI10.7151/DMGT.1187MaRDI QIDQ4458972zbMATH OpenOpenAlexFDO

Authors Agnieszka Görlich, Monika Pilśniak, Mariusz Woźniak

Publication date 25 March 2004

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1187

zbMATH Keywords

cyclic permutationpacking

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• On cyclically embeddable \((n,n-1)\)-graphs
• On cyclically embeddable graphs
• On a conjecture of embeddable graphs
• Packing of graphs and permutations -- a survey
• Embedding graphs of small size

Cited in

(13)

• Embedding graphs of small size
• Packing of graphs and permutations -- a survey
• On cyclically embeddable \((n,n-1)\)-graphs
• Packing of graphs and permutations
• scientific article; zbMATH DE number 426373 (Why is no real title available?)
• The cycle space of an embedded graph
• scientific article; zbMATH DE number 125501 (Why is no real title available?)
• A note on uniquely embeddable graphs
• On cyclically embeddable graphs
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• Graph Drawing
• All trees are 1-embeddable and all except stars are 2-embeddable
• Fixed-point-free embeddings of digraphs with small size

This page was built for publication: On cyclically embeddable (n,n)-graphs

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