Pages that link to "Item:Q1043651"

The following pages link to An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651):

Displaying 11 items.

• An extension of Vizing's adjacency lemma of edge chromatic critical graphs (Q1304811) (← links)
• On a problem concerning ordered colourings (Q1584394) (← 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)
• On the independence number of edge chromatic critical graphs. (Q2881280) (← 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)
• Approximating Vizing's independence number conjecture (Q4616100) (← links)
• Maximum average degree of list-edge-critical graphs and Vizing's conjecture (Q5054037) (← links)
• REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 (Q5076249) (← links)
• Independence number of edge‐chromatic critical graphs (Q6081590) (← links)