Independent sets and 2‐factors in edge‐chromatic‐critical graphs

DOI10.1002/JGT.10141MaRDI QIDQ4458595zbMATH OpenOpenAlexFDO

Authors Stefan Grünewald, Eckhard Steffen

Publication date 15 March 2004

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10141

zbMATH Keywords

edge coloringsindependent setscritical graphschromatic index2-factorsconjectures of Vizing

Mathematics Subject Classification ID

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

Recommendations

• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Bounds for the Independence Number of Critical Graphs
• Vizing's 2-factor conjecture involving large maximum degree
• On the independence number of edge chromatic critical graphs.
• On the independence number of edge chromatic critical graphs

Cites work

• Chromatic-index-critical graphs of even order
• Chromatic-index-critical graphs of orders 11 and 12
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

Cited in

(21)

• A new upper bound for the independence number of edge chromatic critical graphs
• Color-critical graphs with independent cutset
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Vizing's 2-factor conjecture involving large maximum degree
• Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions
• Generalizations of independence and chromatic numbers of a graph
• On the independence number of edge chromatic critical graphs
• An improvement to the Hilton-Zhao vertex-splitting conjecture
• The independence number of an edge-chromatic critical graph
• Fractional matchings, component-factors and edge-chromatic critical graphs
• The overfullness of graphs with small minimum degree and large maximum degree
• Even factors in edge-chromatic-critical graphs with a small number of divalent vertices
• Hamiltonian cycles in critical graphs with large maximum degree
• Chromatic index of dense quasirandom graphs
• Approximating Vizing's independence number conjecture
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• scientific article; zbMATH DE number 6769478 (Why is no real title available?)
• Edge coloring graphs with large minimum degree
• Independence number of edge‐chromatic critical graphs
• 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: Independent sets and 2‐factors in edge‐chromatic‐critical graphs

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