scientific article; zbMATH DE number 6769478

MaRDI QIDQ5354846zbMATH OpenFDO

Authors Saptarshi Bej, Eckhard Steffen

Publication date 4 September 2017

zbMATH Keywords

chromatic indexcritical graphsedge-chromatic numberedge-coloringsfactors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Edge‐chromatic critical graphs and the existence of 1‐factors
• Even factors in edge-chromatic-critical graphs with a small number of divalent vertices
• Fractional matchings, component-factors and edge-chromatic critical graphs
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• On critical graphs for the chromatic edge-stability number
• Structural properties of edge-chromatic critical multigraphs
• Publication:4489800
• On the size of edge-chromatic critical graphs
• On k-factor-critical graphs
• scientific article; zbMATH DE number 2061793

Cited in

(6)

• Graph edge coloring: a survey
• Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs
• Fractional matchings, component-factors and edge-chromatic critical graphs
• Even factors in edge-chromatic-critical graphs with a small number of divalent vertices
• Edge‐chromatic critical graphs and the existence of 1‐factors
• A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture

This page was built for publication:

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