Competitive inheritance and limitedness of graphs (Q4698085)
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 754882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Competitive inheritance and limitedness of graphs |
scientific article; zbMATH DE number 754882 |
Statements
Competitive inheritance and limitedness of graphs (English)
0 references
5 October 1995
0 references
competition graph
0 references
digraph
0 references
cycle
0 references
competition number
0 references
competitively inherited
0 references
strongly inherited
0 references
chordal graphs
0 references
line graphs
0 references
arc graphs
0 references
triangle-free graphs
0 references
limitedness
0 references
inheritance
0 references
series-parallel graphs
0 references
Opsut's conjecture
0 references
0.7822038531303406
0 references
0.7809098362922668
0 references
0.7750258445739746
0 references
