Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1515/acsc-2015-0007 / 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.1515/acsc-2015-0007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2234185770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/ACSC-2015-0007 / rank
 
Normal rank

Latest revision as of 15:29, 30 December 2024

scientific article; zbMATH DE number 7259361
Language Label Description Also known as
English
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
scientific article; zbMATH DE number 7259361

    Statements

    Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (English)
    0 references
    0 references
    0 references
    12 October 2020
    0 references
    batch scheduling
    0 references
    equitable coloring
    0 references
    semi-equitable coloring
    0 references
    cubic graph
    0 references

    Identifiers