Pages that link to "Item:Q3081307"

The following pages link to The independence number of an edge-chromatic critical graph (Q3081307):

Displaying 12 items.

• On the size of edge-chromatic critical graphs (Q1334940) (← links)
• Graph edge coloring: a survey (Q1733850) (← 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)
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
• Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
• Graphs with large maximum degree containing no edge-critical graphs (Q2674560) (← links)
• On the independence number of edge chromatic critical graphs. (Q2881280) (← links)
• Approximating Vizing's independence number conjecture (Q4616100) (← links)
• REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 (Q5076249) (← links)
• Independence number of edge‐chromatic critical graphs (Q6081590) (← links)