The following pages link to (Q5550921):
Displaying 35 items.
- A larger family of planar graphs that satisfy the total coloring conjecture (Q742577) (← links)
- Chromatic number and subtrees of graphs (Q1692708) (← links)
- Terminal-pairability in complete bipartite graphs (Q1693175) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre (Q1837201) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- An improvement to the Hilton-Zhao vertex-splitting conjecture (Q2142639) (← links)
- Zero-divisor graphs and total coloring conjecture (Q2156940) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Hamiltonicity of edge-chromatic critical graphs (Q2182200) (← links)
- Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs (Q2227997) (← links)
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions (Q2415079) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- A new tool for proving Vizing's theorem (Q2449145) (← links)
- On generalisations of the AVD conjecture to digraphs (Q2657104) (← links)
- Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
- The terminal-pairability problem in complete bipartite graphs (Q2659062) (← links)
- Even factors in edge-chromatic-critical graphs with a small number of divalent vertices (Q2670691) (← links)
- Overfullness of critical class 2 graphs with a small core degree (Q2673482) (← links)
- Nordhaus-Gaddum type inequalities for the distinguishing index (Q3390050) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- Approximating Vizing's independence number conjecture (Q4616100) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- (Q5204003) (← links)
- (Q5206907) (← links)
- Double Vizing fans in critical class two graphs (Q6047636) (← links)
- Independence number of edge‐chromatic critical graphs (Q6081590) (← links)
- On the chromatic edge stability index of graphs (Q6116405) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- Total difference chromatic numbers of regular infinite graphs (Q6148294) (← links)
- Tashkinov-trees: an annotated proof (Q6184157) (← links)
- Overfullness of edge‐critical graphs with small minimal core degree (Q6201026) (← links)
- Application of soft sets to graph coloring (Q6552649) (← links)
- Local version of Vizing's theorem for multigraphs (Q6657582) (← links)
