Pages that link to "Item:Q2502907"

The following pages link to A note on Vizing's independence number conjecture of edge chromatic critical graphs (Q2502907):

Displaying 17 items.

• \(\Delta \)-critical graphs with small high vertex cliques (Q765195) (← links)
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651) (← links)
• On a problem concerning ordered colourings (Q1584394) (← links)
• Hamiltonicity of edge-chromatic critical graphs (Q2182200) (← links)
• Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs (Q2227997) (← links)
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions (Q2415079) (← links)
• A note on graphs contraction-critical with respect to independence number (Q2449144) (← links)
• On the independence number of edge chromatic critical graphs (Q2509546) (← links)
• The independence number of an edge-chromatic critical graph (Q3081307) (← links)
• A new upper bound for the independence number of edge chromatic critical graphs (Q3096957) (← links)
• The size of edge chromatic critical graphs with maximum degree 6 (Q3605165) (← links)
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs (Q4458595) (← links)
• Approximating Vizing's independence number conjecture (Q4616100) (← links)
• Maximum average degree of list-edge-critical graphs and Vizing's conjecture (Q5054037) (← links)
• A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
• The spectral radius of edge chromatic critical graphs (Q5962503) (← links)
• Independence number of edge‐chromatic critical graphs (Q6081590) (← links)