Equivalence of two conjectures on equitable coloring of graphs (Q1956256): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123019136 / 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-011-9429-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976812424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic coloring with a maximum color class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:17, 6 July 2024

scientific article
Language Label Description Also known as
English
Equivalence of two conjectures on equitable coloring of graphs
scientific article

    Statements

    Equivalence of two conjectures on equitable coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2013
    0 references
    0 references
    equitable coloring
    0 references
    maximum coloring
    0 references
    \(r\)-equitable graph
    0 references
    maximum degree
    0 references
    independence number
    0 references
    0 references
    0 references