A note on the minimum number of choosability of planar graphs (Q266020): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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-014-9805-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021480812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclically 3-colorable planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating the edge-colourings and total colourings of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colourings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of double disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper bounds on the total and list chromatic numbers of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colorings of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings and list total colorings of planar graphs without intersecting 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum total coloring of planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum number of disjoint linear forests covering a planar graph / rank
 
Normal rank

Revision as of 18:28, 11 July 2024

scientific article
Language Label Description Also known as
English
A note on the minimum number of choosability of planar graphs
scientific article

    Statements

    A note on the minimum number of choosability of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2016
    0 references
    choosability
    0 references
    planar graph
    0 references
    cycle
    0 references
    list edge coloring
    0 references

    Identifiers