Perfectly orderable graphs are quasi-parity graphs: a short proof (Q1095159)
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 4027520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfectly orderable graphs are quasi-parity graphs: a short proof |
scientific article; zbMATH DE number 4027520 |
Statements
Perfectly orderable graphs are quasi-parity graphs: a short proof (English)
0 references
1988
0 references
We show that perfectly orderable graphs are quasi-parity graphs by exhibiting two nodes which are not linked by a chordless odd chain. This proof is short and simpler than the one given by H. Meyniel.
0 references
perfectly orderable graphs
0 references
quasi-parity graphs
0 references
0 references
0 references
0.90271497
0 references
0 references
0.89342517
0 references
0.8927661
0 references
0.89167047
0 references
0.89013803
0 references
0.88510144
0 references
