scientific article; zbMATH DE number 4164908
From MaRDI portal
Publication:3491608
Recommendations
Cited in
(69)- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- The Menger-like property of the three-width of infinite graphs
- Excluding infinite minors
- A note on spanning local tournaments in locally semicomplete digraphs
- Excluding a countable clique
- Chords of longest cycles in cubic graphs
- Clique-width of countable graphs: A compactness property.
- Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
- Cycles with a chord in dense graphs
- A cycle of maximum order in a graph of high minimum degree has a chord
- On the existence of vertex-disjoint subgraphs with high degree sum
- On orienting graphs for connectivity: Projective planes and Halin graphs
- Complexity of some arc-partition problems for digraphs
- Smallest number of vertices in a 2-arc-strong digraph without good pairs
- Non-separating spanning trees and out-branchings in digraphs of independence number 2
- The maximum average connectivity among all orientations of a graph
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
- On Frank's conjecture on \(k\)-connected orientations
- On Eulerian orientations of even-degree hypercubes
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- On a conjecture of Thomassen
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Disjoint sub(di)graphs in digraphs
- Tournaments and Semicomplete Digraphs
- Vertex-disjoint subgraphs with high degree sums
- Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- Packing of rigid spanning subgraphs and spanning trees
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- Strongly 2-connected orientations of graphs
- Small degree out‐branchings
- Sparse spanning \(k\)-connected subgraphs in tournaments
- Existence of spanning \(\mathcal{F}\)-free subgraphs with large minimum degree
- Disjoint isomorphic balanced clique subdivisions
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
- The complexity of 2-vertex-connected orientation in mixed graphs
- Graphs of linear growth have bounded treewidth
- Rainbow clique subdivisions
- Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
- A solution to Erdős and Hajnal’s odd cycle problem
- How to build a pillar: a proof of Thomassen's conjecture
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
- Arc-disjoint out- and in-branchings in compositions of digraphs
- Cycles with many chords
- Strong arc decompositions of split digraphs
- A conjecture generalizing Thomassen's chord conjecture in graph theory
- The Nash-Williams orientation theorem for graphs with countably many ends
- Chords in longest cycles
- Chords of longest cycles passing through a specified small set
- Longest cycles and longest chordless cycles in 2-connected graphs
- Arc-disjoint in- and out-branchings in semicomplete split digraphs
- Compositions of digraphs: a survey
- Highly connected orientations from edge-disjoint rigid subgraphs
- Logical aspects of Cayley-graphs: the group case
- What is on his mind?
- Linked tree-decompositions of represented infinite matroids
- The vertex sets of subtrees of a tree
- Chords in longest cycles in 3-connected graphs
- On orientations preserving edge-connectivity in infinite graphs
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Non-separating subgraphs in highly connected graphs
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs
- Spanning 2-strong tournaments in 3-strong semicomplete digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491608)
