Improved upper bounds on acyclic edge colorings

DOI10.1007/S10255-014-0293-ZzbMATH Open1295.05113OpenAlexW2123533801MaRDI QIDQ403494FDOQ403494

Authors: Yu-Wen Wu, Guiying Yan 

Publication date: 29 August 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-014-0293-z

Recommendations

• Improved bounds on acyclic edge colouring
• Improved upper bound for acyclic chromatic number of graphs.
• Improved upper bound for generalized acyclic chromatic number of graphs
• Improved bounds on coloring of graphs
• Improved bounds on the generalized acyclic chromatic number
• A new bound on the acyclic edge chromatic number
• Improved bounds for acyclic chromatic index of planar graphs
• Improved bounds for the chromatic number of a graph
• An improved bound on the minimal number of edges in color-critical graphs
• An improved bound on acyclic chromatic index of planar graphs

zbMATH Keywords

graph coloring[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Lov%EF%BF%BD%EF%BF%BDsz+local+lemma&go=Go Lov��sz local lemma]acyclic edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Acyclic colorings of planar graphs
• Improved bounds on acyclic edge colouring
• Acyclic edge colorings of graphs
• Acyclic coloring of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph colouring and the probabilistic method

Cited In (11)

• Improved bounds on the generalized acyclic chromatic number
• A new approach to compute acyclic chromatic index of certain chemical structures
• New bounds for the acyclic chromatic index
• Improved bounds on coloring of graphs
• Improved upper bound for acyclic chromatic number of graphs.
• A new bound on the acyclic edge chromatic number
• Algorithmic aspects of acyclic edge colorings
• Title not available (Why is that?)
• Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
• Improved bounds on acyclic edge colouring
• Bounds on edge colorings with restrictions on the union of color classes

This page was built for publication: Improved upper bounds on acyclic edge colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403494)