Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Lian-Cui Zuo / rank
Normal rank
 
Property / author
 
Property / author: Lian-Cui Zuo / 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/s10878-015-9895-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W417070490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable chromatic number of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable and proportional coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on equitable colorings of forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable \(\Delta\)-coloring of 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: Equivalence of two conjectures on equitable coloring of graphs / 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: An Ore-type theorem on equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existential problem of a weight-controlled subset and its application to school timetable construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equitable chromatic number of complete \(n\)-partite graphs / 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 colorings of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Given Group and Given Graph-Theoretical Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable total coloring of \(C_m\square C_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear (n-1)-arboricity of Cartesian product graphs / rank
 
Normal rank

Latest revision as of 16:52, 12 July 2024

scientific article
Language Label Description Also known as
English
Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
scientific article

    Statements

    Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (English)
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    equitable coloring
    0 references
    equitable chromatic number
    0 references
    equitable chromatic threshold
    0 references
    Cartesian product
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references