The following pages link to (Q5558480):
Displaying 50 items.
- A note on the size of edge-chromatic 4-critical graphs (Q294519) (← links)
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- Edge-chromatic numbers of Mycielski graphs (Q409467) (← links)
- On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors (Q423967) (← links)
- Some criteria for a graph to be class 1 (Q442377) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- An improved upper bound on the linear 2-arboricity of planar graphs (Q501025) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index (Q580363) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- Chromatic index critical graphs of order 9 (Q787152) (← links)
- A new method of proving theorems on chromatic index (Q801928) (← links)
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) (Q933675) (← links)
- An adjacency Lemma for critical multigraphs (Q942112) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
- Edge covered critical multigraphs (Q998374) (← links)
- On the size of edge-coloring critical graphs with maximum degree 4 (Q998479) (← links)
- The edge version of Hadwiger's conjecture (Q1011784) (← links)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- A \(\Delta\)-subgraph condition for a graph to be class 1 (Q1087551) (← links)
- Recent progress on edge-colouring graphs (Q1090683) (← links)
- On graphs critical with respect to edge-colourings (Q1164055) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- On critical graphs with chromatic index 4 (Q1214435) (← links)
- Note to the paper of Grünbaum on acyclic colorings (Q1222168) (← links)
- On small graphs critical with respect to edge colourings (Q1232418) (← links)
