A sufficient condition for a planar graph to be class I (Q2456359): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some sufficient conditions for a planar graph of maximum degree six to be Class 1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on class one graphs with maximum degree six / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge coloring of graphs with small average degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar graphs of maximum degree seven are Class I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring edges of graphs embedded in a surface of characteristic zero. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5558480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on graphs of class I / rank | |||
Normal rank |
Latest revision as of 11:13, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A sufficient condition for a planar graph to be class I |
scientific article |
Statements
A sufficient condition for a planar graph to be class I (English)
0 references
18 October 2007
0 references
planar graph
0 references
edge colouring
0 references
chromatic index
0 references
cycle
0 references