scientific article
From MaRDI portal
Publication:3491608
zbMath0709.05030MaRDI QIDQ3491608
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs ⋮ The maximum average connectivity among all orientations of a graph ⋮ Cycles with a chord in dense graphs ⋮ Small degree out‐branchings ⋮ Bipartitions of highly connected tournaments ⋮ Vertex-disjoint subgraphs with high degree sums ⋮ The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings ⋮ Edge-disjoint in- and out-branchings in tournaments and related path problems ⋮ The Menger-like property of the three-width of infinite graphs ⋮ Chords of longest cycles in cubic graphs ⋮ A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Packing of rigid spanning subgraphs and spanning trees ⋮ Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 ⋮ Decomposing edge-colored graphs under color degree constraints ⋮ The complexity of 2-vertex-connected orientation in mixed graphs ⋮ Graphs of linear growth have bounded treewidth ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ Decomposing locally semicomplete digraphs into strong spanning subdigraphs ⋮ 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 ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs ⋮ Non-separating subgraphs in highly connected graphs ⋮ Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree ⋮ Subgraphs of large connectivity and chromatic number in graphs of large chromatic number ⋮ Clique-width of countable graphs: A compactness property. ⋮ Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. ⋮ Strongly 2-connected orientations of graphs ⋮ Infinite, highly connected digraphs with no two arc-disjoint spanning trees ⋮ Excluding infinite minors ⋮ Chords in longest cycles ⋮ On orienting graphs for connectivity: Projective planes and Halin graphs ⋮ \(k\)-strong spanning local tournaments in locally semicomplete digraphs ⋮ Spanning 2-strong tournaments in 3-strong semicomplete digraphs ⋮ Logical aspects of Cayley-graphs: the group case ⋮ What is on his mind? ⋮ Linked tree-decompositions of represented infinite matroids ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ On a conjecture of Thomassen ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ A note on spanning local tournaments in locally semicomplete digraphs ⋮ Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs ⋮ Complexity of some arc-partition problems for digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Smallest number of vertices in a 2-arc-strong digraph without good pairs ⋮ Disjoint sub(di)graphs in digraphs ⋮ On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs ⋮ Excluding a countable clique ⋮ Non-separating spanning trees and out-branchings in digraphs of independence number 2
