Acyclic edge coloring of graphs with large girths
From MaRDI portal
Publication:1934376
DOI10.1007/s11425-012-4442-7zbMath1257.05044OpenAlexW2263289706MaRDI QIDQ1934376
Publication date: 28 January 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-012-4442-7
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (2)
Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian ⋮ Acyclic edge coloring of IC-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Asymptotic lower bounds for Ramsey functions
- Acyclic edge coloring of planar graphs without small cycles
- Topology of series-parallel networks
- The entire coloring of series-parallel graphs
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic and oriented chromatic numbers of graphs
- Star coloring of graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Estimation of sparse hessian matrices and graph coloring problems
- A parallel algorithmic version of the local lemma
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic Edge Colouring of Outerplanar Graphs
This page was built for publication: Acyclic edge coloring of graphs with large girths
