Cut-edges and regular factors in regular graphs of odd degree

DOI10.1007/s00373-020-02242-0zbMath1459.05265arXiv1806.05347OpenAlexW3097062267MaRDI QIDQ2657077

Douglas B. West, Dara Zirlin, Andre Raspaud, Alexandr V. Kostochka, Bjarne Toft

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05347

zbMATH Keywords

matchingregular graphcut-edgegraph factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items

Largest 2-regular subgraphs in 3-regular graphs

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Even regular factor of regular graphs and number of cut edges
• Regular factors of simple regular graphs and factor-spectra
• Factors and factorizations of graphs—a survey
• Regular factors of regular graphs
• Maximum matchings in a regular graph of specified connectivity and bounded order
• Reguläre Faktoren von Graphen.
• The Factors of Graphs
• A Short Proof of the Factor Theorem for Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item