2-linked graphs

From MaRDI portal

Publication:1150633

Jump to:navigation, search

DOI10.1016/S0195-6698(80)80039-4zbMath0457.05044MaRDI QIDQ1150633

Carsten Thomassen

Publication date: 1980

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

disjoint paths k-linked graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Shortest edge-disjoint paths in graphs, The structure of graphs with no K3,3 immersion, 4‐Separations in Hajós graphs, A graph minor condition for graphs to be \(k\)-linked, Half-integral linkages in highly connected directed graphs, Unnamed Item, Orientations of infinite graphs with prescribed edge-connectivity, On a coloring conjecture of Hajós, Cycle-connected mixed graphs and related problems, Cycle-connected mixed graphs and related problems, Walking through waypoints, Shortest Two Disjoint Paths in Polynomial Time, The Directed Disjoint Shortest Paths Problem, Connectivity for Kite-Linked Graphs, Unnamed Item, Unnamed Item, Edge-disjoint odd cycles in 4-edge-connected graphs, The \(k\)-subconnectedness of planar graphs, Linkage for the diamond and the path with four vertices, The complexity of induced minors and related problems, Finding Two Edge-Disjoint Paths with Length Constraints, Paths and edge-connectivity in graphs. III: Six-terminal k paths, Non-planar extensions of subdivisions of planar graphs, The structure of graphs not topologically containing the Wagner graph, Separating double rays in locally finite planar graphs, Subdivisions in apex graphs, Characterization of \((m, n)\)-linked planar graphs, Three commodity flows in graphs, Finding a path with two labels forbidden in group-labeled graphs, Independent paths and \(K_{5}\)-subdivisions, Contractions to k₈, Some recent progress and applications in graph minor theory, Edge-disjoint paths and cycles inn-edge-connected graphs, When Do Gomory--Hu Subtrees Exist?, The reduction of graph families closed under contraction, The maximum number of edges in a graph with fixed edge-degree, Linking four vertices in graphs of large connectivity, Projective plan and Möbius band obstructions, Finding disjoint paths with different path-costs: Complexity and algorithms, Linear time algorithms for two disjoint paths problems on directed acyclic graphs, Obstructions for the Disk and the Cylinder Embedding Extension Problems, Rooted \(K_4\)-minors, The Induced Disjoint Paths Problem, The disjoint paths problem in quadratic time, Bonds with parity constraints, Linkless and flat embeddings in 3-space, Optimal connectivity for fat-triangle linkages, On shortest disjoint paths in planar graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem, Packing cycles through prescribed vertices under modularity constraints, The 1-fixed-endpoint path cover problem is Polynomial on interval graphs, Every 4k-edge-connected graph is weakly 3k-linked, Nowhere-zero 15-flow in 3-edge-connected bidirected graphs, On the tractability of some natural packing, covering and partitioning problems, A sufficient condition for graphs to be weakly \(k\)-linked, Highly connected non-2-linked digraphs, Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity, The extremal function for 3-linked graphs, Biased graphs with no two vertex-disjoint unbalanced cycles, Conjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs), A new proof of the flat wall theorem, The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs, The Hadwiger number of infinite vertex-transitive graphs, On finite convexity spaces induced by sets of paths in graphs, General vertex disjoint paths in series-parallel graphs, Induced disjoint paths problem in a planar digraph, Half-integral packing of odd cycles through prescribed vertices, An improved linear edge bound for graph linkages, The extremal function for \(K_{9}\) minors, 4-connected triangulations and 4-orderedness, Graph minors and linkages, Improved Algorithms for the 2-Vertex Disjoint Paths Problem, Shortest \((A+B)\)-path packing via hafnian, Characterization of \(k\)-subconnected graphs, 7-connected graphs are 4-ordered, Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor, Graph minor theory, Removable cycles in non-bipartite graphs, Two disjoint shortest paths problem with non-negative edge length, A simpler proof for the two disjoint odd cycles theorem, K-linked graphs with girth condition, The linkedness of cubical polytopes: the cube, Inseparability graphs of oriented matroids, K₅-Subdivisions in Graphs, Graph minors. IX: Disjoint crossed paths, Characterizing Graphs with Crossing Number at Least 2, Reflections on graph theory, \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked, Bounds on path connectivity, Disjoint shortest paths in graphs, Variational analysis down under open problem session, Arc-Disjoint Directed and Undirected Cycles in Digraphs, On possible counterexamples to Negami's planar cover conjecture, Graphs with at most one crossing, The Kelmans-Seymour conjecture. I: Special separations, The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\), The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\), The Kelmans-Seymour conjecture. IV: A proof, Highly linked graphs, Cliques, minors and apex graphs, Frustration-critical signed graphs, Two edge-disjoint paths with length constraints, Disjoint sub(di)graphs in digraphs, A sufficient condition for a graph to be weakly k-linked, The extremal function for \(K_{8}^{-}\) minors, Kuratowski's theorem, The 2-linkage problem for acyclic digraphs, About some cyclic properties in digraphs, Pendant tree-connectivity, Rooted topological minors on four vertices, Paths and edge-connectivity in graphs, Hadwiger's conjecture for \(K_ 6\)-free graphs, Fixed-parameter tractability for subset feedback set problems with parity constraints, Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\), Edge-disjoint paths in planar graphs

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1150633&oldid=13207302"