首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
Constructing Tree-Decompositions That Display All Topological Ends
被引:1
作者
:
Pitz, Max
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Dept Math, Bundesstr 55, D-20146 Hamburg, Germany
Univ Hamburg, Dept Math, Bundesstr 55, D-20146 Hamburg, Germany
Pitz, Max
[
1
]
机构
:
[1]
Univ Hamburg, Dept Math, Bundesstr 55, D-20146 Hamburg, Germany
来源
:
COMBINATORICA
|
2022年
/ 42卷
/ 05期
关键词
:
05C63;
05C05;
GRAPHS;
D O I
:
10.1007/s00493-022-4987-1
中图分类号
:
O1 [数学];
学科分类号
:
0701 ;
070101 ;
摘要
:
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
引用
收藏
页码:763 / 769
页数:7
相关论文
共 9 条
[1]
Duality theorems for stars and combs I: Arbitrary stars and combs
[J].
Burger, Carl
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Burger, Carl
;
Kurkofka, Jan
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Kurkofka, Jan
.
JOURNAL OF GRAPH THEORY,
2022,
99
(04)
:525
-554
[2]
All Graphs Have Tree-Decompositions Displaying Their Topological Ends
[J].
论文数:
引用数:
h-index:
机构:
Carmesin, Johannes
.
COMBINATORICA,
2019,
39
(03)
:545
-596
[3]
THE END STRUCTURE OF A GRAPH - RECENT RESULTS AND OPEN PROBLEMS
[J].
DIESTEL, R
论文数:
0
引用数:
0
h-index:
0
机构:
Faculty of Mathematics (SFB 343), Bielefeld University, W-4800 Bielefeld
DIESTEL, R
.
DISCRETE MATHEMATICS,
1992,
100
(1-3)
:313
-327
[4]
Graph-theoretical versus topological ends of graphs
[J].
Diestel, R
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Diestel, R
;
Kühn, D
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Kühn, D
.
JOURNAL OF COMBINATORIAL THEORY SERIES B,
2003,
87
(01)
:197
-206
[5]
Diestel R., 2005, GRAPH THEORY
[6]
UBER UNENDLICHE WEGE IN GRAPHEN
[J].
HALIN, R
论文数:
0
引用数:
0
h-index:
0
HALIN, R
.
MATHEMATISCHE ANNALEN,
1964,
157
(02)
:125
-137
[7]
Kurkofka J., ARXIV
[8]
AN END-FAITHFUL SPANNING TREE COUNTEREXAMPLE
[J].
SEYMOUR, P
论文数:
0
引用数:
0
h-index:
0
机构:
RUTGERS STATE UNIV, CTR DIMACS, NEW BRUNSWICK, NJ 08903 USA
SEYMOUR, P
;
THOMAS, R
论文数:
0
引用数:
0
h-index:
0
机构:
RUTGERS STATE UNIV, CTR DIMACS, NEW BRUNSWICK, NJ 08903 USA
THOMAS, R
.
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY,
1991,
113
(04)
:1163
-1171
[9]
INFINITE CONNECTED GRAPHS WITH NO END-PRESERVING SPANNING-TREES
[J].
THOMASSEN, C
论文数:
0
引用数:
0
h-index:
0
机构:
Mathematical Institute, The Technical University of Denmark, DK-2800 Lyngby
THOMASSEN, C
.
JOURNAL OF COMBINATORIAL THEORY SERIES B,
1992,
54
(02)
:322
-324
←
1
→
共 9 条
[1]
Duality theorems for stars and combs I: Arbitrary stars and combs
[J].
Burger, Carl
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Burger, Carl
;
Kurkofka, Jan
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Univ Hamburg, Dept Math, Bundesstr 55 Geomatikum, D-20146 Hamburg, Germany
Kurkofka, Jan
.
JOURNAL OF GRAPH THEORY,
2022,
99
(04)
:525
-554
[2]
All Graphs Have Tree-Decompositions Displaying Their Topological Ends
[J].
论文数:
引用数:
h-index:
机构:
Carmesin, Johannes
.
COMBINATORICA,
2019,
39
(03)
:545
-596
[3]
THE END STRUCTURE OF A GRAPH - RECENT RESULTS AND OPEN PROBLEMS
[J].
DIESTEL, R
论文数:
0
引用数:
0
h-index:
0
机构:
Faculty of Mathematics (SFB 343), Bielefeld University, W-4800 Bielefeld
DIESTEL, R
.
DISCRETE MATHEMATICS,
1992,
100
(1-3)
:313
-327
[4]
Graph-theoretical versus topological ends of graphs
[J].
Diestel, R
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Diestel, R
;
Kühn, D
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
Kühn, D
.
JOURNAL OF COMBINATORIAL THEORY SERIES B,
2003,
87
(01)
:197
-206
[5]
Diestel R., 2005, GRAPH THEORY
[6]
UBER UNENDLICHE WEGE IN GRAPHEN
[J].
HALIN, R
论文数:
0
引用数:
0
h-index:
0
HALIN, R
.
MATHEMATISCHE ANNALEN,
1964,
157
(02)
:125
-137
[7]
Kurkofka J., ARXIV
[8]
AN END-FAITHFUL SPANNING TREE COUNTEREXAMPLE
[J].
SEYMOUR, P
论文数:
0
引用数:
0
h-index:
0
机构:
RUTGERS STATE UNIV, CTR DIMACS, NEW BRUNSWICK, NJ 08903 USA
SEYMOUR, P
;
THOMAS, R
论文数:
0
引用数:
0
h-index:
0
机构:
RUTGERS STATE UNIV, CTR DIMACS, NEW BRUNSWICK, NJ 08903 USA
THOMAS, R
.
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY,
1991,
113
(04)
:1163
-1171
[9]
INFINITE CONNECTED GRAPHS WITH NO END-PRESERVING SPANNING-TREES
[J].
THOMASSEN, C
论文数:
0
引用数:
0
h-index:
0
机构:
Mathematical Institute, The Technical University of Denmark, DK-2800 Lyngby
THOMASSEN, C
.
JOURNAL OF COMBINATORIAL THEORY SERIES B,
1992,
54
(02)
:322
-324
←
1
→