Tutte paths and long cycles in circuit graphs
type: Item
instance of: scholarly article
title: Tutte paths and long cycles in circuit graphs
zbMATH Open document ID: 1504.05154
author: Michael C. Wigal
author: Xingxing Yu
published in: Journal of Combinatorial Theory. Series B
publication date: 2022-11-23T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7622608
zbMATH Keywords: cycle
zbMATH Keywords: bridge
zbMATH Keywords: Tutte subgraph
MaRDI profile type: Publication
full work available at URL: j.jctb.2022.07.006
OpenAlex ID: W4289745805
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Long cycles in graphs on a fixed surface
cites work: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
cites work: Long cycles in 3-connected graphs
cites work: Circumference of essentially 4-connected planar triangulations
cites work: Longest cycles in 3-connected planar graphs
cites work: The four-colour theorem
cites work: A theorem on paths in planar graphs
cites work: 4-connected projective planar graphs are Hamiltonian
cites work: On Hamiltonian Circuits
cites work: A Theorem on Planar Graphs
cites work: Disjoint paths, planarizing cycles, and spanning walks
DOI: 10.1016/J.JCTB.2022.07.006
Recommended article: Long paths and cycles in tough graphs
Recommended article: Long paths and large cycles in finite graphs
Recommended article: On circuits in graphs
Recommended article: Q4014295
Recommended article: Q3768926
Recommended article: Long cycles and paths in distance graphs
Recommended article: Q3480078
Recommended article: Cycle lengths and circuit matroids of graphs
description: scientific article; zbMATH DE number 7622608