Parity results on connected f-factors

DOI10.1016/0012-365X(86)90063-4zbMath0594.05052OpenAlexW1992361955MaRDI QIDQ1076695

Kenneth A. Berman

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90063-4

zbMATH Keywords

decompositionsHamiltonian circuitsspanning subgraphf-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

On common edges in optimal solutions to traveling salesman and other optimization problems, A parity theorem about trees with specified degrees, A PPA parity theorem about trees in a bipartite graph, Some graphic uses of an even number of odd nodes

Cites Work

• Unnamed Item
• Spanning subgraphs with specified valencies
• The Subgraph Problem
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• The Factors of Graphs
• On Hamiltonian Circuits