Equitable coloring planar graphs with large girth (Q2470470): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.08.059 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2027879769 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable and proportional coloring of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable coloring of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable coloring and the maximum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620621 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable colorings of outerplanar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Equitable Coloring of <i>d</i>-Degenerate Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A list analogue of equitable coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4247466 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On equitable coloring of bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4471329 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4348809 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4255998 / rank | |||
Normal rank |
Latest revision as of 16:55, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equitable coloring planar graphs with large girth |
scientific article |
Statements
Equitable coloring planar graphs with large girth (English)
0 references
14 February 2008
0 references
An equitable coloring of a graph \(G\) is a proper vertex coloring such that the difference in size of every two color classes is at most one. The equitable threshold \(\chi_{\text{Eq}}^\ast(G)\) is the smallest integer \(m\) such that \(G\) has an equitable coloring using \(n\) colors for every \(n \geq m\). It is proved in this paper that \(\chi_{\text{Eq}}^\ast(G)=\chi(G)\) if \(G\) is a non-bipartite planar graph with girth at least 26 and minimum degree at least 2, or \(G\) is a 2-connected outerplanar graph with girth at least 4.
0 references
equitable coloring
0 references
planar graphs
0 references
outerplanar graphs
0 references
girth
0 references