On cyclically embeddable \((n,n-1)\)-graphs
From MaRDI portal
Publication:1613481
DOI10.1016/S0012-365X(01)00339-9zbMath1001.05101MaRDI QIDQ1613481
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Fixed-point-free embeddings of digraphs with small size ⋮ Packing of graphs and permutations -- a survey
This page was built for publication: On cyclically embeddable \((n,n-1)\)-graphs
