Pages that link to "Item:Q4458595"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Independent sets and 2‐factors in edge‐chromatic‐critical graphs (Q4458595):

Displaying 21 items.

Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651) (← links)
Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
An improvement to the Hilton-Zhao vertex-splitting conjecture (Q2142639) (← links)
Chromatic index of dense quasirandom graphs (Q2171027) (← 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 Vizing's independence number conjecture of edge chromatic critical graphs (Q2502907) (← links)
On the independence number of edge chromatic critical graphs (Q2509546) (← links)
Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
Even factors in edge-chromatic-critical graphs with a small number of divalent vertices (Q2670691) (← 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)
Color-critical graphs with independent cutset (Q3804719) (← links)
Approximating Vizing's independence number conjecture (Q4616100) (← links)
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
(Q5354846) (← links)
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree (Q5866456) (← links)
Independence number of edge‐chromatic critical graphs (Q6081590) (← links)
Edge coloring graphs with large minimum degree (Q6094039) (← links)