On cyclically embeddable (n,n-1)-graphs
From MaRDI portal
Publication:1613481
DOI10.1016/S0012-365X(01)00339-9zbMATH Open1001.05101MaRDI QIDQ1613481FDOQ1613481
Authors: Mariusz Woźniak 
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
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
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- Packing of graphs and permutations -- a survey
- 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)-graphs
- Graph Drawing
- On cyclically embeddable graphs
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)
