2-linked graphs

DOI10.1016/S0195-6698(80)80039-4MaRDI QIDQ1150633zbMATH OpenFDO

Authors Carsten Thomassen

Publication date 1980

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

zbMATH Keywords

disjoint pathsk-linked graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 3693329 (Why is no real title available?)
• scientific article; zbMATH DE number 3627227 (Why is no real title available?)
• A Polynomial Solution to the Undirected Two Paths Problem
• Circuits containing specified edges
• Disjoint paths in graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
• Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
• Minimum partition of a matroid into independent subsets
• Multi-Commodity Network Flows
• Note on circuits containing specified edges
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• On the Problem of Decomposing a Graph into n Connected Factors
• On the existence of certain disjoint arcs in graphs
• On two minimax theorems in graph
• Planarity and duality of finite and infinite graphs
• Simplicial Decompositions of Infinite Graphs
• The directed subgraph homeomorphism problem

Cited in

(only showing first 100 items - show all)

• Frustration-critical signed graphs
• Cycle-connected mixed graphs and related problems
• Cycle-connected mixed graphs and related problems
• Variational analysis down under open problem session
• The complexity of induced minors and related problems
• Separating double rays in locally finite planar graphs
• Orientations of infinite graphs with prescribed edge-connectivity
• Graph minor theory
• Every 4k-edge-connected graph is weakly 3k-linked
• Contractions to k₈
• Two arc disjoint paths in Eulerian digraphs
• Disjoint sub(di)graphs in digraphs
• Walking through waypoints
• A sufficient condition for graphs to be weakly \(k\)-linked
• List-coloring graphs without subdivisions and without immersions
• Characterization of \((m, n)\)-linked planar graphs
• Highly linked graphs
• Characterizing graphs with crossing number at least 2
• The Hadwiger number of infinite vertex-transitive graphs
• Projective plan and Möbius band obstructions
• Rooted topological minors on four vertices
• On finite convexity spaces induced by sets of paths in graphs
• Rooted K₄-minors
• A new proof of the flat wall theorem
• Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
• Subdivisions in apex graphs
• Kuratowski's theorem
• The Directed Disjoint Shortest Paths Problem
• Paths and edge-connectivity in graphs
• Two edge-disjoint paths with length constraints
• The \(k\)-subconnectedness of planar graphs
• Edge-disjoint odd cycles in 4-edge-connected graphs
• A graph minor condition for graphs to be \(k\)-linked
• K-linked graphs with girth condition
• The disjoint paths problem in quadratic time
• Bonds with parity constraints
• Linkless and flat embeddings in 3-space
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
• The 2-linkage problem for acyclic digraphs
• Nowhere-zero 15-flow in 3-edge-connected bidirected graphs
• 7-connected graphs are 4-ordered
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• 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)
• Graph minors and linkages
• The structure of graphs not topologically containing the Wagner graph
• Graphs with at most one crossing
• Biased graphs with no two vertex-disjoint unbalanced cycles
• Half-integral linkages in highly connected directed graphs
• Linkage for the diamond and the path with four vertices
• The structure of graphs with no K3,3 immersion
• Reflections on graph theory
• The linkedness of cubical polytopes: the cube
• Edge-disjoint paths and cycles inn-edge-connected graphs
• Fixed-parameter tractability for subset feedback set problems with parity constraints
• Shortest \((A+B)\)-path packing via hafnian
• On possible counterexamples to Negami's planar cover conjecture
• Linking four vertices in graphs of large connectivity
• The extremal function for \(K_{8}^{-}\) minors
• Obstructions for the Disk and the Cylinder Embedding Extension Problems
• Local degree conditions for \({K}_9\)-minors in graphs
• Connectivity for kite-linked graphs
• The Induced Disjoint Paths Problem
• K₅-Subdivisions in Graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
• Three commodity flows in graphs
• Characterization of \(k\)-subconnected graphs
• Packing cycles through prescribed vertices under modularity constraints
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Independent paths and \(K_{5}\)-subdivisions
• When do Gomory-Hu subtrees exist?
• The extremal function for 3-linked graphs
• 4-connected triangulations and 4-orderedness
• Linkages and removable paths avoiding vertices
• A simpler proof for the two disjoint odd cycles theorem
• Some recent progress and applications in graph minor theory
• The reduction of graph families closed under contraction
• Non-planar extensions of subdivisions of planar graphs
• An improved linear edge bound for graph linkages
• Removable cycles in non-bipartite graphs
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
• Inseparability graphs of oriented matroids
• Linear time algorithms for two disjoint paths problems on directed acyclic graphs
• The extremal function for \(K_{9}\) minors
• On the tractability of some natural packing, covering and partitioning problems
• Arc-disjoint directed and undirected cycles in digraphs
• Bounds on path connectivity
• Disjoint shortest paths in graphs
• 4‐Separations in Hajós graphs
• On shortest disjoint paths in planar graphs
• 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
• Finding two edge-disjoint paths with length constraints
• scientific article; zbMATH DE number 7561373 (Why is no real title available?)
• Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
• Cliques, minors and apex graphs
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Pendant tree-connectivity

This page was built for publication: 2-linked graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150633)