论文信息 - Multigraphs without large bonds are wqo by contraction

Multigraphs without large bonds are wqo by contraction

We show that the class of multigraphs with at most $p$ connected components and bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p,k$. (A bond is a minimal non-empty edge cut.) We also characterize canonical antichains for this relation and show that they are fundamental.

[1] C. Nash-Williams. On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[2] Guoli Ding,et al. On canonical antichains , 2009, Discret. Math..

[3] Michael R. Fellows,et al. Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications , 2012, Algorithmica.

[4] Frances A. Rosamond,et al. Well-Quasi-Ordering Bounded Treewidth Graphs , 2009 .

[5] Robin Thomas,et al. Typical Subgraphs of 3- and 4-Connected Graphs , 1993, J. Comb. Theory, Ser. B.

[6] Guoli Ding,et al. Subgraphs and well-quasi-ordering , 1992, J. Graph Theory.

[7] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[8] Paul D. Seymour,et al. Graph minors XXIII. Nash-Williams' immersion conjecture , 2010, J. Comb. Theory, Ser. B.

[9] Peter Damaschke,et al. Induced subgraphs and well-quasi-ordering , 1990, J. Graph Theory.

[10] Paul D. Seymour,et al. Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[11] William T. Tutte,et al. A theory of 3-connected graphs , 1961 .

[12] Chun-Hung Liu,et al. Graph structures and well-quasi-ordering , 2014 .

[13] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

[14] Guoli Ding,et al. Chordal graphs, interval graphs, and wqo , 1998, J. Graph Theory.