Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
A proper vertex colouring of a graph is called equitable if the colour classes differ in size by at most one. The authors extend the conjecture of \textit{B.-L. Chen}, \textit{K.-W. Lih}, and \textit{P.-L. Wu} [Eur. J. Comb. 15, No. ~5, 443--447 (1994; Zbl 0809.05050)] to disconnected graphs. The new conjecture says that if an \(r\)-colourable graph \(G\) with maximum degree \(r\), \(r \geq 6\) is not equitably \(r\)-colourable then \(r\) is odd, \(G\) contains \(K_{r,r}\) and \(V(G)\) can be partitioned into subsets \(V_0,\dots,V_t\) such that \(G[V_0] =K_{r,r}\) and for each \(i=1,2,\dots,t\), \(G[V_i] = K_r\). It is proved that these two conjectures are equivalent. | |||
Property / review text: A proper vertex colouring of a graph is called equitable if the colour classes differ in size by at most one. The authors extend the conjecture of \textit{B.-L. Chen}, \textit{K.-W. Lih}, and \textit{P.-L. Wu} [Eur. J. Comb. 15, No. ~5, 443--447 (1994; Zbl 0809.05050)] to disconnected graphs. The new conjecture says that if an \(r\)-colourable graph \(G\) with maximum degree \(r\), \(r \geq 6\) is not equitably \(r\)-colourable then \(r\) is odd, \(G\) contains \(K_{r,r}\) and \(V(G)\) can be partitioned into subsets \(V_0,\dots,V_t\) such that \(G[V_0] =K_{r,r}\) and for each \(i=1,2,\dots,t\), \(G[V_i] = K_r\). It is proved that these two conjectures are equivalent. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Gabriel Semanisin / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5931408 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
equitable colouring | |||
Property / zbMATH Keywords: equitable colouring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
proper colouring | |||
Property / zbMATH Keywords: proper colouring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
decomposition | |||
Property / zbMATH Keywords: decomposition / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123233448 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00493-010-2420-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2125772985 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spanning subgraphs of random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Almost \(H\)-factors in dense graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(H\)-factors in dense graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable coloring and the maximum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The infamous upper tail / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of the Seymour conjecture for large graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On equitable \(\Delta\)-coloring of graphs with low average degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On equitable coloring of bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4780802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4716273 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect Graphs and an Application to Optimizing Municipal Services / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4348809 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4255998 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:37, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture |
scientific article |
Statements
Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (English)
0 references
22 July 2011
0 references
A proper vertex colouring of a graph is called equitable if the colour classes differ in size by at most one. The authors extend the conjecture of \textit{B.-L. Chen}, \textit{K.-W. Lih}, and \textit{P.-L. Wu} [Eur. J. Comb. 15, No. ~5, 443--447 (1994; Zbl 0809.05050)] to disconnected graphs. The new conjecture says that if an \(r\)-colourable graph \(G\) with maximum degree \(r\), \(r \geq 6\) is not equitably \(r\)-colourable then \(r\) is odd, \(G\) contains \(K_{r,r}\) and \(V(G)\) can be partitioned into subsets \(V_0,\dots,V_t\) such that \(G[V_0] =K_{r,r}\) and for each \(i=1,2,\dots,t\), \(G[V_i] = K_r\). It is proved that these two conjectures are equivalent.
0 references
equitable colouring
0 references
proper colouring
0 references
decomposition
0 references