The following pages link to (Q4111593):
Displayed 18 items.
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Acyclic colorings of products of trees (Q845661) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- Every planar graph has an acyclic 7-coloring (Q1245228) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- New formulae for the decycling number of graphs (Q1630929) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Acyclic Vertex Coloring of Graphs of Maximum Degree Six (Q2840537) (← links)
- Acyclic coloring of graphs (Q3977081) (← links)
- (Q5708559) (← links)
- Acyclic dominating partitions (Q5893941) (← links)
- Acyclic dominating partitions (Q5900080) (← links)