Rooted topological minors on four vertices (Q2099413): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2021.05.002
@@ Property / DOI: 10.1016/j.jctb.2021.05.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2021.05.002
+Normal rank
@@ Property / OpenAlex ID @@
+W3166092152
@@ Property / OpenAlex ID: W3166092152 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles through specified vertices of a graph
@@ Property / cites work: Cycles through specified vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Hajos' graph-coloring conjecture: Variations and counterexamples
+Normal rank
@@ Property / cites work @@
+In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
+Normal rank
@@ Property / cites work @@
+Linkage for the diamond and the path with four vertices
+Normal rank
@@ Property / cites work @@
+On the conjecture of Hajos
@@ Property / cites work: On the conjecture of Hajos / rank @@
+Normal rank
@@ Property / cites work @@
+The Kelmans-Seymour conjecture. I: Special separations
+Normal rank
@@ Property / cites work @@
+The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
+Normal rank
@@ Property / cites work @@
+The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
+Normal rank
@@ Property / cites work @@
+The Kelmans-Seymour conjecture. IV: A proof
@@ Property / cites work: The Kelmans-Seymour conjecture. IV: A proof / rank @@
+Normal rank
@@ Property / cites work @@
+A nine point theorem for 3-connected graphs
@@ Property / cites work: A nine point theorem for 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circuits through prescribed vertices in <i>k</i>‐connected <i>k</i>‐regular graphs
+Normal rank
@@ Property / cites work @@
+Circuits through specified edges
@@ Property / cites work: Circuits through specified edges / rank @@
+Normal rank
@@ Property / cites work @@
+Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
+Normal rank
@@ Property / cites work @@
+One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
+Normal rank
@@ Property / cites work @@
+Cycles through a prescribed vertex set in \(n\)-connected graphs.
+Normal rank
@@ Property / cites work @@
+Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
+Normal rank
@@ Property / cites work @@
+Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
+Normal rank
@@ Property / cites work @@
+On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
+Normal rank
@@ Property / cites work @@
+Q3972952
@@ Property / cites work: Q3972952 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent paths and \(K_{5}\)-subdivisions
@@ Property / cites work: Independent paths and \(K_{5}\)-subdivisions / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphieeigenschaften und mittlere Kantendichte von Graphen
+Normal rank
@@ Property / cites work @@
+Über die Maximalzahl kreuzungsfreier H-Wege
@@ Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of Menger's graph theorem
@@ Property / cites work: Applications of Menger's graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Hadwiger's conjecture for \(K_ 6\)-free graphs
@@ Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+Connectivity for Kite-Linked Graphs
@@ Property / cites work: Connectivity for Kite-Linked Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An improved linear edge bound for graph linkages
@@ Property / cites work: An improved linear edge bound for graph linkages / rank @@
+Normal rank
@@ Property / cites work @@
+The extremal function for 3-linked graphs
@@ Property / cites work: The extremal function for 3-linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Hajós' conjecture
@@ Property / cites work: Some remarks on Hajós' conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Subdivisions in planar graphs
@@ Property / cites work: Subdivisions in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs. II: A special case
@@ Property / cites work: Disjoint paths in graphs. II: A special case / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs. III: Characterization
@@ Property / cites work: Disjoint paths in graphs. III: Characterization / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing Hajós' 4-coloring conjecture to 4-connected graphs
+Normal rank
@@ Property / cites work @@
+Cycles and Connectivity in Graphs
@@ Property / cites work: Cycles and Connectivity in Graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2021.05.002
@@ Property / DOI: 10.1016/J.JCTB.2021.05.002 / rank @@
+Normal rank