Bipolarizable graphs (Q912868)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4145949
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipolarizable graphs |
scientific article; zbMATH DE number 4145949 |
Statements
Bipolarizable graphs (English)
0 references
1990
0 references
Perfectly orderable graphs are those for which an order of the nodes can be found such that for any subgraph \(G'\) of G the sequential node coloring algorithm (``always use the smaller possible colour'') gives an optimal coloring for \(G'\). Bipolarisable graphs admit a perfect order such that for any chain \(P_ 4(a,b,c,d)\) of 4 nodes we have \(a>b\) and \(c<d\). This class of perfectly orderable graphs is compared with other known classes of perfectly orderable graph.
0 references
Perfectly orderable graphs
0 references
sequential node coloring algorithm
0 references
Bipolarisable graphs
0 references
0 references
0 references
0 references
0.8929203
0 references
0 references
0 references
