Efficient algorithms for acyclic colorings of graphs
From MaRDI portal
Publication:1978502
DOI10.1016/S0304-3975(97)00254-5zbMATH Open0941.68096MaRDI QIDQ1978502FDOQ1978502
Authors: Yanyan Li 
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Algorithmic aspects of acyclic edge colorings
- On efficient coloring of chordless graphs
- Acyclic coloring of graphs
- Efficient bounds on a branch and bound algorithm for graph colouration
- Efficient algorithms for the edge-cover coloring problem
- An algorithm for optimal acyclic edge-colouring of cubic graphs
- Acyclic edge coloring of graphs
- scientific article; zbMATH DE number 956855
- Acyclic edge colorings of graphs
- Efficient algorithms for parameterized \(H\)-colorings
Cites Work
- Title not available (Why is that?)
- Improved algorithms for graph four-connectivity
- The Point-Arboricity of Planar Graphs
- The point-arboricity of a graph
- Node-and edge-deletion NP-complete problems
- Title not available (Why is that?)
- An Efficient Parallel Biconnectivity Algorithm
- Acyclic colorings of planar graphs
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- An O(logn) parallel connectivity algorithm
- Efficient algorithms for vertex arboricity of planar graphs
- An approach to the subgraph homeomorphism problem
- Finding Triconnected Components by Local Replacement
Cited In (13)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- Acyclic and star colorings of cographs
- Heuristics for deciding collectively rational consumption behavior
- A Game Theoretic Approach for Efficient Graph Coloring
- Some recent progress and applications in graph minor theory
- Efficient algorithms for the edge-cover coloring problem
- Title not available (Why is that?)
- Vertex arboricity of planar graphs without chordal 6-cycles
- Acyclic edge-coloring using entropy compression
- Coloring graphs using two colors while avoiding monochromatic cycles
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
This page was built for publication: Efficient algorithms for acyclic colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978502)
