The following pages link to Acyclic coloring of graphs (Q3977081):
Displaying 50 items.
- Improved bounds on the generalized acyclic chromatic number (Q272792) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- New bounds for the acyclic chromatic index (Q294561) (← links)
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Improved upper bounds on acyclic edge colorings (Q403494) (← links)
- Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
- Improved bounds on coloring of graphs (Q412254) (← links)
- Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← links)
- Acyclic edge colouring of plane graphs (Q427892) (← links)
- Acyclic chromatic indices of planar graphs with girth at least five (Q434197) (← links)
- Acyclic chromatic indices of fully subdivided graphs (Q436602) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- On acyclic edge-coloring of complete bipartite graphs (Q729782) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
- Acyclic colorings of subcubic graphs (Q834929) (← links)
- Acyclic colorings of products of trees (Q845661) (← links)
- Analysis of a heuristic for acyclic edge colouring (Q845729) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Further result on acyclic chromatic index of planar graphs (Q908318) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- Acyclic edge colouring of planar graphs without short cycles (Q968412) (← links)
- About acyclic edge colourings of planar graphs (Q975506) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- Linear coloring of graphs (Q1584255) (← links)
- Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036) (← links)
- Acyclic edge coloring of 4-regular graphs without 3-cycles (Q1712783) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
