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 11 items.

• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651) (← links)
• An extension of Vizing's adjacency lemma of edge chromatic critical graphs (Q1304811) (← links)
• On the size of edge-chromatic critical graphs (Q1334940) (← links)
• On a problem concerning ordered colourings (Q1584394) (← 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)
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
• On the independence number of edge chromatic critical graphs. (Q2881280) (← links)
• The size of edge chromatic critical graphs with maximum degree 6 (Q3605165) (← links)
• Approximating Vizing's independence number conjecture (Q4616100) (← links)
• Independence number of edge‐chromatic critical graphs (Q6081590) (← links)