Fractional matchings, component-factors and edge-chromatic critical graphs

DOI10.1007/s00373-020-02266-6zbMath1459.05263arXiv1903.12385OpenAlexW3121046609MaRDI QIDQ2657106

Antje Klopp, Eckhard Steffen

Publication date: 17 March 2021

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

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

zbMATH Keywords

fractional matchingsedge-chromatic critical graphsfactors in graphsstar-cycle factorsVizing's critical graph conjectures

Mathematics Subject Classification ID

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

Related Items (2)

Component factors and binding number conditions in graphs ⋮ Even factors in edge-chromatic-critical graphs with a small number of divalent vertices

Cites Work

• On factors with given components
• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
• An extension of Tutte's 1-factor theorem
• Graph edge coloring: a survey
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• The independence number of an edge-chromatic critical graph
• Chromatic-index-critical graphs of even order
• Approximating Vizing's independence number conjecture
• The fractional matching numbers of graphs
• Paths, Trees, and Flowers
• The average degree of an edge‐chromatic critical graph II
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Subgraphs with prescribed valencies
• The 1-Factors of Oriented Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fractional matchings, component-factors and edge-chromatic critical graphs