Pages that link to "Item:Q1944091"
From MaRDI portal
The following pages link to Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices (Q1944091):
Displaying 8 items.
- Acyclic chromatic indices of fully subdivided graphs (Q436602) (← links)
- Analysis of a heuristic for acyclic edge colouring (Q845729) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- Algorithmic aspects of acyclic edge colorings (Q1348909) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- Acyclic colouring of some line graphs (Q2844386) (← links)
- Upper bounds on the acyclic chromatic index of degenerate graphs (Q6197756) (← links)