How is a chordal graph like a supersolvable binary matroid? (Q704292)
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: How is a chordal graph like a supersolvable binary matroid? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How is a chordal graph like a supersolvable binary matroid? |
scientific article |
Statements
How is a chordal graph like a supersolvable binary matroid? (English)
0 references
13 January 2005
0 references
Binary matroids
0 references
Chordal graphs
0 references
Cliques
0 references
Supersolvable matroids
0 references
0.79051924
0 references
0.78908944
0 references
0 references
0 references
0.7639426
0 references
0 references
0.7605871
0 references
