Efficient algorithms for acyclic colorings of graphs
From MaRDI portal
Publication:1978502
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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 742981 (Why is no real title available?)
- Acyclic colorings of planar graphs
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- An approach to the subgraph homeomorphism problem
- Efficient algorithms for vertex arboricity of planar graphs
- Finding Triconnected Components by Local Replacement
- Improved algorithms for graph four-connectivity
- Node-and edge-deletion NP-complete problems
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- The Point-Arboricity of Planar Graphs
- The point-arboricity of a graph
Cited in
(14)- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- A Game Theoretic Approach for Efficient Graph Coloring
- Acyclic edge-coloring using entropy compression
- Coloring graphs using two colors while avoiding monochromatic cycles
- scientific article; zbMATH DE number 6469209 (Why is no real title available?)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
- Some recent progress and applications in graph minor theory
- Vertex arboricity of planar graphs without chordal 6-cycles
- Heuristics for deciding collectively rational consumption behavior
- Efficient algorithms for the edge-cover coloring problem
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Acyclic and star colorings of cographs
- Efficient algorithms for vertex arboricity of planar graphs
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)
