On the size of edge-coloring critical graphs with maximum degree 4 (Q998479): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2007.10.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the size of edge-chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring critical graphs with high degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of edge chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the size of edge chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2007.10.013 / rank
 
Normal rank

Latest revision as of 12:07, 10 December 2024

scientific article
Language Label Description Also known as
English
On the size of edge-coloring critical graphs with maximum degree 4
scientific article

    Statements

    Identifiers