A PPA parity theorem about trees in a bipartite graph
type: Item
instance of: scholarly article
title: A PPA parity theorem about trees in a bipartite graph
zbMATH Open document ID: 1479.05298
author: Kathie Cameron
author: Jack Edmonds
published in: Discrete Applied Mathematics
publication date: 2022-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7452359
zbMATH Keywords: Berman's theorem
zbMATH Keywords: Thomason's theorem
zbMATH Keywords: Smith's theorem
MaRDI profile type: Publication
Wikidata QID: Q113877257
full work available at URL: j.dam.2020.03.064
OpenAlex ID: W3017741487
cites work: Parity results on connected f-factors
cites work: Cycles containing all the odd-degree vertices
cites work: Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
cites work: Colouring Some Classes of Perfect Graphs Robustly
cites work: Some graphic uses of an even number of odd nodes
cites work: Understanding PPA-completeness
cites work: Euler Complexes
cites work: Exponentiality of the exchange algorithm for finding another room-partitioning
cites work: The complexity of finding a second Hamiltonian cycle in cubic graphs
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs
cites work: Chords in longest cycles
cites work: On Hamiltonian Circuits
cites work: THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE
DOI: 10.1016/J.DAM.2020.03.064
description: scientific article; zbMATH DE number 7452359