On the equitable vertex arboricity of graphs (Q5739585): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free star-access in parallel memory systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on relaxed equitable coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875172 / 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: Perfect Graphs and an Application to Optimizing Municipal Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and edge choosability of planar graphs without five cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable vertex arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable list colorings of planar graphs without short cycles / rank
 
Normal rank

Latest revision as of 07:15, 12 July 2024

scientific article; zbMATH DE number 6604244
Language Label Description Also known as
English
On the equitable vertex arboricity of graphs
scientific article; zbMATH DE number 6604244

    Statements

    Identifiers