Bipartable graphs (Q1080439)
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: Bipartable graphs |
scientific article; zbMATH DE number 3966127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartable graphs |
scientific article; zbMATH DE number 3966127 |
Statements
Bipartable graphs (English)
0 references
1988
0 references
We consider a construction which associates with a graph G another graph G' such that if G' is a bipartite graph, G is perfectly orderable. For such a graph G we give a polynomial algorithm for an optimal coloring by delivering a perfect order on his nodes. This class of graphs is shown to be different from the known classes of perfectly orderable graphs.
0 references
bipartite graph
0 references
polynomial algorithm
0 references
optimal coloring
0 references
perfectly orderable graphs
0 references
0 references
0 references
0 references
