On cyclically embeddable (n,n)-graphs

DOI10.7151/DMGT.1187zbMATH Open1037.05046OpenAlexW1988517301MaRDI QIDQ4458972FDOQ4458972

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

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

packingcyclic permutation

Mathematics Subject Classification ID

Graph theory (05C99)

Cited In (12)

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

   Recommendations

• On cyclically embeddable \((n,n-1)\)-graphs 👍 👎
• On cyclically embeddable graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Packing of graphs and permutations -- a survey 👍 👎
• Embedding graphs of 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)