Pages that link to "Item:Q1329811"
From MaRDI portal
The following pages link to How to find overfull subgraphs in graphs with large maximum degree (Q1329811):
Displaying 12 items.
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- How to find overfull subgraphs in graphs with large maximum degree. II (Q1594580) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Fractionally edge colouring graphs with large maximum degree in linear time (Q2851436) (← links)
- A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- On the conformability of regular line graphs (Q6181221) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
- On the chromatic index of complementary prisms (Q6621267) (← links)
