On b-acyclic chromatic number of a graph

DOI10.1007/S40314-022-02156-YMaRDI QIDQ2685280zbMATH OpenOpenAlexFDO

Authors Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Publication date 20 February 2023

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2206.06478

zbMATH Keywords

acyclic b-chromatic numberacyclic coloringb-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 2192123
• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic colorings of products of cycles
• On the acyclic chromatic number of Hamming graphs
• Improved upper bound for acyclic chromatic number of graphs.

Cites work

• \(B\)-chromatic number of cacti
• \(b\)-colouring outerplanar graphs with large girth
• Acyclic coloring of graphs
• Acyclic coloring of graphs and entropy compression method
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic colorings of graph subdivisions revisited
• Acyclic colorings of planar graphs
• Acyclic vertex coloring of graphs of maximum degree 5
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Computing vertex-disjoint paths in large graphs using MAOs
• Edge Grundy numbers of the regular Turán graphs
• Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs
• Graphs of girth at least 7 have high \(b\)-chromatic number
• scientific article; zbMATH DE number 1953103 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• Network Flow and Testing Graph Connectivity
• New algorithms for maximum disjoint paths based on tree-likeness
• On acyclic colorings of graphs on surfaces
• On acyclic colorings of planar graphs
• On Grundy and b-chromatic number of some families of graphs: a comparative study
• On the b-coloring of tight graphs
• On the complexity of vertex-disjoint length-restricted path problems
• On the equality of the grundy and ochromatic numbers of a graph
• Results on the Grundy chromatic number of graphs
• Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
• Some perfect coloring properties of graphs
• The b-chromatic number and related topics -- a survey
• The b-chromatic number of a graph
• The complexity of finding maximum disjoint paths with length constraints

Cited in

(5)

• scientific article; zbMATH DE number 6928965 (Why is no real title available?)
• On b-acyclic chromatic number of a graph
• An extensive study on the k-tuple total dominator chromatic number of graphs
• Dominated coloring in certain trees
• A new approach to b-coloring of regular graphs

This page was built for publication: On b-acyclic chromatic number of a graph

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