Bipartable graphs (Q1080439): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(88)90050-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4213049991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Which line-graphs are perfectly orderable? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On brittle graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Four classes of perfectly orderable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tolerance graphs / rank | |||
Normal rank | |||
Latest revision as of 14:29, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartable graphs |
scientific article |
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
