The vertex separation number of a graph equals its path-width (Q1198094): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6767936
Property / Recommended article
 
Property / Recommended article: The total vertex separation number of a graph / rank
 
Normal rank
Property / Recommended article: The total vertex separation number of a graph / qualifier
 
Similarity Score: 0.9055479
Amount0.9055479
Unit1
Property / Recommended article: The total vertex separation number of a graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: The cutwidth of a graph and the vertex separation number of the line graph / rank
 
Normal rank
Property / Recommended article: The cutwidth of a graph and the vertex separation number of the line graph / qualifier
 
Similarity Score: 0.8883711
Amount0.8883711
Unit1
Property / Recommended article: The cutwidth of a graph and the vertex separation number of the line graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: The total vertex separation number and profile of a graph / rank
 
Normal rank
Property / Recommended article: The total vertex separation number and profile of a graph / qualifier
 
Similarity Score: 0.8787625
Amount0.8787625
Unit1
Property / Recommended article: The total vertex separation number and profile of a graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the path separation number of graphs / rank
 
Normal rank
Property / Recommended article: On the path separation number of graphs / qualifier
 
Similarity Score: 0.876839
Amount0.876839
Unit1
Property / Recommended article: On the path separation number of graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: The vertex detour number of a graph / rank
 
Normal rank
Property / Recommended article: The vertex detour number of a graph / qualifier
 
Similarity Score: 0.8638441
Amount0.8638441
Unit1
Property / Recommended article: The vertex detour number of a graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the separation number of a graph / rank
 
Normal rank
Property / Recommended article: On the separation number of a graph / qualifier
 
Similarity Score: 0.8579941
Amount0.8579941
Unit1
Property / Recommended article: On the separation number of a graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: Path Separability of Graphs / rank
 
Normal rank
Property / Recommended article: Path Separability of Graphs / qualifier
 
Similarity Score: 0.8512016
Amount0.8512016
Unit1
Property / Recommended article: Path Separability of Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3104343 / rank
 
Normal rank
Property / Recommended article: Q3104343 / qualifier
 
Similarity Score: 0.848306
Amount0.848306
Unit1
Property / Recommended article: Q3104343 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3561269 / rank
 
Normal rank
Property / Recommended article: Q3561269 / qualifier
 
Similarity Score: 0.8467877
Amount0.8467877
Unit1
Property / Recommended article: Q3561269 / qualifier
 

Revision as of 05:04, 18 April 2025

scientific article
Language Label Description Also known as
English
The vertex separation number of a graph equals its path-width
scientific article

    Statements

    The vertex separation number of a graph equals its path-width (English)
    0 references
    16 January 1993
    0 references
    computational complexity
    0 references
    graph's vertex separation number
    0 references
    path-width
    0 references
    decision algorithms
    0 references
    tree obstructions
    0 references

    Identifiers