Pages that link to "Item:Q3004663"
From MaRDI portal
The following pages link to An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663):
Displaying 7 items.
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Note on incidence chromatic number of subquartic graphs (Q2410036) (← links)
- Acyclic 4-edge colouring of non-regular subcubic graphs in linear time (Q2449094) (← links)
- Optimal Acyclic Edge Colouring of Grid Like Graphs (Q3591309) (← links)