Edge-choosability of planar graphs without non-induced 5-cycles (Q976112): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jian-Sheng Cai / rank
Normal rank
 
Property / author
 
Property / author: Jian-Feng Hou / rank
Normal rank
 
Property / author
 
Property / author: Gui Zhen Liu / rank
Normal rank
 
Property / author
 
Property / author: Jian-Sheng Cai / rank
 
Normal rank
Property / author
 
Property / author: Jian-Feng Hou / rank
 
Normal rank
Property / author
 
Property / author: Gui Zhen Liu / 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.1016/j.ipl.2008.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024763003 / 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: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs / 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: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of degree 4 are 5-edge-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge chromatic number of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties and edge choosability of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles / 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: Choosability, edge choosability and total choosability of outerplane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-choosability of multicircuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge choosability of planar graphs without small cycles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Edge-choosability of planar graphs without non-induced 5-cycles
scientific article

    Statements

    Edge-choosability of planar graphs without non-induced 5-cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2010
    0 references
    planar graph
    0 references
    edge-coloring
    0 references
    choosability
    0 references
    cycle
    0 references
    chord
    0 references
    combinatorial problems
    0 references

    Identifiers