Nonseparable graphs with a given number of cycles

DOI10.1002/jgt.3190180803zbMath0814.05047OpenAlexW2087848298MaRDI QIDQ4317220

Brian Alspach, Dragan Marušič, Gerhard Ringel, Ranko Šćepanović, Gek Ling Chia

Publication date: 18 April 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180803

zbMATH Keywords

cyclesnon-separable graphsplanar Hamiltonian graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item