Pages that link to "Item:Q2494116"
From MaRDI portal
The following pages link to Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116):
Displaying 15 items.
- Improved bounds on the generalized acyclic chromatic number (Q272792) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Acyclic edge coloring of subcubic graphs (Q998411) (← links)
- Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- Edge-coloring of plane multigraphs with many colors on facial cycles (Q2185732) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs (Q4650187) (← links)
- Edge-coloring of plane graphs with many colors on faces (Q6621184) (← links)
