A 3-color theorem on plane graphs without 5-circuits (Q2644333): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3139765 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4000782 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the three color problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-colorable plane graphs without 5- and 7-cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sufficient condition for planar graphs to be 3-colorable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-colorings of plane graphs / rank | |||
Normal rank |
Latest revision as of 14:29, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A 3-color theorem on plane graphs without 5-circuits |
scientific article |
Statements
A 3-color theorem on plane graphs without 5-circuits (English)
0 references
31 August 2007
0 references
plane graph
0 references
circuit
0 references
coloring
0 references
0 references