Pages that link to "Item:Q1934376"
From MaRDI portal
The following pages link to Acyclic edge coloring of graphs with large girths (Q1934376):
Displaying 11 items.
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (Q370939) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← links)
- Algorithmic aspects of acyclic edge colorings (Q1348909) (← links)
- Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
- Edge-colorings of some large graphs on alphabets (Q2713603) (← links)
- Acyclic edge coloring of series-parallel graphs and Meredith graphs (Q4689005) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- On the chromatic number of a family of odd hole free graphs (Q6670771) (← links)