Pages that link to "Item:Q5883290"
From MaRDI portal
The following pages link to Recoloring Planar Graphs of Girth at Least Five (Q5883290):
Displaying 12 items.
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Five-coloring graphs on the torus (Q1333321) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- Distinguishing colorings of 3-connected planar graphs with five colors (Q2799604) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- Optimally reconfiguring list and correspondence colourings (Q6057471) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
- List recoloring of planar graphs (Q6671387) (← links)