Pages that link to "Item:Q3839894"
From MaRDI portal
The following pages link to Acyclic Colourings of Planar Graphs with Large Girth (Q3839894):
Displaying 45 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Star coloring of graphs with girth at least five (Q343773) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Acyclic colorings of subcubic graphs (Q834929) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Online coloring graphs with high girth and high odd girth (Q974990) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- Acyclic chromatic indices of planar graphs with large girth (Q2275931) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Acyclic coloring of IC-planar graphs (Q2329208) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
- On acyclic colorings of planar graphs. (Reprint) (Q2497996) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable (Q2851536) (← links)
- A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
- Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
- On some arboricities in planar graphs (Q3439376) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- Acyclic list 7‐coloring of planar graphs (Q4539872) (← links)
- Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
- Acyclic colouring of 1-planar graphs (Q5954081) (← links)
- Injective edge-coloring of subcubic graphs (Q6115745) (← links)
