2-walks in circuit graphs

DOI10.1006/jctb.1994.1068zbMath0807.05027OpenAlexW1993177856MaRDI QIDQ1338316

R. Bruce Richter, Zhi-Cheng Gao

Publication date: 29 November 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1068

zbMATH Keywords

3-connected planar graph2-walksBarnette's Theoremcircuit graphsconjecture of Jackson and Wormald

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (23)

Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ Computing Tutte Paths ⋮ Some results on greedy embeddings in metric spaces ⋮ Enumerative properties of rooted circuit maps ⋮ Forbidden subgraphs and the existence of a 2-walk ⋮ Decomposing plane cubic graphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Dominating sets in triangulations on surfaces ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ Unnamed Item ⋮ What is on his mind? ⋮ Unnamed Item ⋮ 3-trees with few vertices of degree 3 in circuit graphs ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ \([2,3\)-factors in a 3-connected infinite planar graph.] ⋮ Disjoint paths, planarizing cycles, and spanning walks ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ Unnamed Item

This page was built for publication: 2-walks in circuit graphs