A generalization of simplicial elimination orderings (Q4894623)
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 932199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of simplicial elimination orderings |
scientific article; zbMATH DE number 932199 |
Statements
25 November 1996
0 references
simplicial elimination orderings
0 references
pretty vertex
0 references
clique
0 references
optimal colouring
0 references
triangle-free graphs
0 references
algorithm
0 references
bichromatic interchanges
0 references
pretty graph
0 references
perfect
0 references
clique-separable graph
0 references
A generalization of simplicial elimination orderings (English)
0 references
0.7986213564872742
0 references
0.7582579851150513
0 references
0.751261830329895
0 references
0.7499939203262329
0 references
0.7462846040725708
0 references
