Equitable partition of planar graphs (Q2022132): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1907.09911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on linear coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Point-Arboricity of Planar 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: Planar graphs without 4- and 5-cycles are acyclically 4-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable partition of graphs into induced forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / 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: Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Equitable Coloring of <i>d</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of planar graphs with maximum degree at least nine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph into degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable defective coloring of sparse planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable vertex arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable vertex arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255998 / rank
 
Normal rank

Latest revision as of 14:50, 25 July 2024

scientific article
Language Label Description Also known as
English
Equitable partition of planar graphs
scientific article

    Statements

    Equitable partition of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2021
    0 references
    induced forest
    0 references
    degenerate graph
    0 references
    equitable partition
    0 references
    planar graph
    0 references

    Identifiers