Some graphic uses of an even number of odd nodes

DOI10.5802/AIF.1694MaRDI QIDQ1296145zbMATH OpenOpenAlexWikidataFDO

Authors Kathie Cameron, Jack Edmonds

Publication date 12 July 1999

Published in Annales de l’institut Fourier (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=AIF_1999__49_3_815_0, https://eudml.org/doc/75365

zbMATH Keywords

circuitexchange graphflowerhamiltonianlollipopparitypathtree

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parity theorems for paths and cycles in graphs
• Cycles containing all the odd-degree vertices
• A parity theorem about trees with specified degrees
• scientific article; zbMATH DE number 894703

Cites work

• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Hamiltonian cycles in a graph of degree 4
• scientific article; zbMATH DE number 4199652 (Why is no real title available?)
• scientific article; zbMATH DE number 1263206 (Why is no real title available?)
• On common edges in optimal solutions to traveling salesman and other optimization problems
• On the complexity of the parity argument and other inefficient proofs of existence
• Pairs of Adjacent Hamiltonian Circuits with Small Intersection
• Parity results on connected f-factors
• Parity theorems for paths and cycles in graphs
• Properties of a Euler graph
• The adjacency relation on the traveling salesman polytope is NP-Complete

Cited in

(13)

• A PPA parity theorem about trees in a bipartite graph
• Cycles containing all the odd-degree vertices
• Understanding PPA-completeness
• A parity theorem about trees with specified degrees
• On finding another room-partitioning of the vertices
• Euler complexes (oiks)
• Euler complexes
• Even and odd Eulerian paths.
• Parity theorems for paths and cycles in graphs
• scientific article; zbMATH DE number 4112624 (Why is no real title available?)
• scientific article; zbMATH DE number 894703 (Why is no real title available?)
• Exponentiality of the exchange algorithm for finding another room-partitioning
• scientific article; zbMATH DE number 3307332 (Why is no real title available?)

This page was built for publication: Some graphic uses of an even number of odd nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296145)