Spanning connectedness and Hamiltonian thickness of graphs and interval graphs (Q2827796)
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 6641999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning connectedness and Hamiltonian thickness of graphs and interval graphs |
scientific article; zbMATH DE number 6641999 |
Statements
21 October 2016
0 references
Chvátal-Erdős theorem
0 references
fault tolerance
0 references
forward degree sequence
0 references
graph power
0 references
interval representation
0 references
local spanning cut function
0 references
normal path algorithm
0 references
path cover number
0 references
rooted path system
0 references
scattering number
0 references
spanning rail connectivity
0 references
spanning fan connectivity
0 references
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs (English)
0 references
0.7537969946861267
0 references
0.7369992733001709
0 references
0.7323276996612549
0 references
0.7286785244941711
0 references
