On b-acyclic chromatic number of a graph
From MaRDI portal
Publication:2685280
DOI10.1007/s40314-022-02156-yOpenAlexW4312143381MaRDI QIDQ2685280
Sylwia Cichacz, Marcin Anholcer, Iztok Peterin
Publication date: 20 February 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.06478
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(b\)-colouring outerplanar graphs with large girth
- On the b-coloring of tight graphs
- Acyclic vertex coloring of graphs of maximum degree 5
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- On acyclic colorings of planar graphs
- The b-chromatic number of a graph
- The \(b\)-chromatic number and related topics -- a survey
- Complexity of Grundy coloring and its variants
- On the complexity of vertex-disjoint length-restricted path problems
- New algorithms for maximum disjoint paths based on tree-likeness
- On acyclic colorings of graphs on surfaces
- Acyclic colorings of graph subdivisions revisited
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- Computing vertex-disjoint paths in large graphs using MAOs
- Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs
- Acyclic coloring of graphs and entropy compression method
- Graphs of girth at least 7 have high \(b\)-chromatic number
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- On Grundy and b-chromatic number of some families of graphs: a comparative study
- b-chromatic number of cacti
- On the equality of the grundy and ochromatic numbers of a graph
- Acyclic coloring of graphs
- Network Flow and Testing Graph Connectivity
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- The complexity of finding maximum disjoint paths with length constraints
- Acyclic colorings of planar graphs
This page was built for publication: On b-acyclic chromatic number of a graph
