Minimal reducible bounds for 1-nonouterplanar graphs (Q1567656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimal reducible bounds for 1-nonouterplanar graphs |
scientific article; zbMATH DE number 1462313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal reducible bounds for 1-nonouterplanar graphs |
scientific article; zbMATH DE number 1462313 |
Statements
Minimal reducible bounds for 1-nonouterplanar graphs (English)
0 references
28 May 2001
0 references
The authors consider the subclass of 1-nonouterplanar graphs of the class of planar graphs, slightly wider than the class of outerplanar graphs. They prove that for this class of graphs there are infinitely many minimal reducible bounds in contrast with the class of outerplanar graphs, and describe all of them.
0 references
graph coloring
0 references
minimal reducible bounds
0 references
outerplanar graphs
0 references
0.8490740656852722
0 references
0.7661139369010925
0 references
0.7304705381393433
0 references
0.7262840270996094
0 references
