Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-013-1396-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016619939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles / 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: Equitable List Coloring of Graphs with Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of a result of Corrádi and Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equitable \(\Delta\)-coloring of graphs with low average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A list analogue of equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable list coloring of planar graphs without 4- and 6-cycles / 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 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: Equitable colorings of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable list-coloring for graphs of maximum degree 3 / 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 list coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable list colorings of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable and equitable list colorings of graphs / rank
 
Normal rank

Latest revision as of 02:39, 10 July 2024

scientific article
Language Label Description Also known as
English
Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
scientific article

    Statements

    Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2015
    0 references
    equitable list coloring
    0 references
    equitable coloring
    0 references
    plane graph
    0 references
    degenerate
    0 references

    Identifiers