Pages that link to "Item:Q3096957"

The following pages link to A new upper bound for the independence number of edge chromatic critical graphs (Q3096957):

Displaying 3 items.

• Vizing's 2-factor conjecture involving toughness and maximum degree conditions (Q2415079) (← links)
• Approximating Vizing's independence number conjecture (Q4616100) (← links)
• Independence number of edge‐chromatic critical graphs (Q6081590) (← links)