The following pages link to (Q3118960):
Displaying 21 items.
- A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
- Short Fans and the 5/6 Bound for Line Graphs (Q5357961) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree (Q5866456) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Locally self-avoiding Eulerian tours (Q5915927) (← links)
- Chromatic index, treewidth and maximum degree (Q5916063) (← links)
- The spectral radius of edge chromatic critical graphs (Q5962503) (← links)
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable (Q6041542) (← links)
- Double Vizing fans in critical class two graphs (Q6047636) (← links)
- The average degree of edge chromatic critical graphs with maximum degree seven (Q6074595) (← links)
- Decomposition of class II graphs into two class I graphs (Q6080564) (← links)
- A note on Goldberg's conjecture on total chromatic numbers (Q6081546) (← links)
- Independence number of edge‐chromatic critical graphs (Q6081590) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
- On Gupta’s Codensity Conjecture (Q6171261) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
- The core conjecture of Hilton and Zhao (Q6196157) (← links)
- Tight bounds on the chromatic edge stability index of graphs (Q6197718) (← links)
- Overfullness of edge‐critical graphs with small minimal core degree (Q6201026) (← links)
