Convex programming and circumference of 3-connected graphs of low genus
From MaRDI portal
Publication:1354114
DOI10.1006/jctb.1996.1719zbMath0867.05041MaRDI QIDQ1354114
Publication date: 3 August 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.1719
torus; projective plane; connectivity; circumference; Klein bottle; longest cycle; circuit graph; Tutte path
90C25: Convex programming
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C40: Connectivity
Related Items
Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs, Enumerative properties of rooted circuit maps, The circumference of a graph with no \(K_{3,t}\)-minor, Tutte cycles in circuit graphs, Long cycles in graphs on a fixed surface, Long cycles in 3-connected graphs