The \(b\)-continuity of graphs with large girth (Q1684929): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1602.01298 / rank
 
Normal rank

Revision as of 20:48, 18 April 2024

scientific article
Language Label Description Also known as
English
The \(b\)-continuity of graphs with large girth
scientific article

    Statements

    The \(b\)-continuity of graphs with large girth (English)
    0 references
    0 references
    12 December 2017
    0 references
    A proper vertex coloring of a simple graph \(G\) is called a \(b\)-coloring if there exists a vertex in every color class joined with some vertex in every other color class. The \(b\)-chromatic number of \(G\) is defined as the greatest integer \(b\) such that \(G\) has a \(b\)-coloring. The \(b\)-chromatic number is widely studied widely in the recent years from the computational point of view. Suppose \(G\) has a \(b\)-coloring with \(t\) colors for each integer between \(c\) and \(d\) where \(c\) is the chromatic number and \(d\) is the \(b\)-chromatic number then we call \(G\) a \(b\)-continuous graph. The authors establish that if \(G\) has girth at least 10 then it is \(b\)-continuous. They also made a strong assertion that unlike in the classical coloring problem remaining locally acyclic is conducive to get a \(b\)-coloring of a graph. They also raised some interesting questions like (a) Are regular graphs with girth at least 5 \(b\)-continuous? and (b) Are bipartite graphs with girth at least 6 \(b\)-continuous? and indicated the potential for further research.
    0 references
    \(b\)-coloring
    0 references
    \(b\)-continuity
    0 references
    large girth
    0 references

    Identifiers