\textsc{Tessellability} and \textsc{tessellability completion} of graphs with few \(P_4\) (Q6492322)
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 7837944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \textsc{Tessellability} and \textsc{tessellability completion} of graphs with few \(P_4\) |
scientific article; zbMATH DE number 7837944 |
Statements
\textsc{Tessellability} and \textsc{tessellability completion} of graphs with few \(P_4\) (English)
0 references
25 April 2024
0 references
graph tessellations
0 references
graphs with few \(P_4\)'s
0 references
quasi-threshold graphs
0 references
0.8745929002761841
0 references
0.8503243327140808
0 references
0.829919159412384
0 references
0.8284222483634949
0 references
0.746112048625946
0 references
