On cyclically embeddable (n,n-1)-graphs

DOI10.1016/S0012-365X(01)00339-9MaRDI QIDQ1613481zbMATH OpenFDO

Authors Mariusz Woźniak

Publication date 29 August 2002

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationembeddingcyclic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On cyclically embeddable (n,n)-graphs
• On cyclically embeddable graphs
• On embeddings of circulant graphs
• On embedding a cycle in a plane graph
• Publication:4888120
• The cycle space of an embedded graph
• Embedding of cycles in arrangement graphs
• Even embeddings of the complete graphs and their cycle parities
• Embedding cycles of given length in oriented graphs
• scientific article; zbMATH DE number 4198023

Cited in

(9)

• On cyclically embeddable graphs
• Packing of graphs and permutations -- a survey
• scientific article; zbMATH DE number 426373 (Why is no real title available?)
• scientific article; zbMATH DE number 125501 (Why is no real title available?)
• 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)-graphs
• Graph Drawing

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

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