scientific article; zbMATH DE number 3243269

zbMath0151.33403MaRDI QIDQ5530472

No author found.

Publication date: 1965

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

topology

Related Items (38)

Recognizing a class of bicircular matroids ⋮ Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ On digraphs with no two disjoint directed cycles ⋮ Nearly sign-nonsingular matrices ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Super-cyclically edge-connected regular graphs ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ A tight Erdős-Pósa function for long cycles ⋮ On several sorts of connectivity ⋮ Unbreakable matroids ⋮ Disjoint cycles and chorded cycles in a graph with given minimum degree ⋮ Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles ⋮ Degree-constrained 2-partitions of graphs ⋮ Vertex-disjoint directed and undirected cycles in general digraphs ⋮ Arkhipov's theorem, graph minors, and linear system nonlocal games ⋮ Super cyclically edge connected transitive graphs ⋮ A note on disjoint cycles ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ On the problem of finding disjoint cycles and dicycles in a digraph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Edge reductions in cyclically \(k\)-connected cubic graphs ⋮ Biased graphs. II: The three matroids ⋮ Cycle multiplicity of some total graphs ⋮ Biased graphs with no two vertex-disjoint unbalanced cycles ⋮ On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ On separating cycles in graphs ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ Cut Dominants and Forbidden Minors ⋮ Unnamed Item ⋮ Disjoint directed and undirected paths and cycles in digraphs ⋮ On cyclic edge-connectivity of transitive graphs ⋮ Graphs without two vertex-disjoint \(S\)-cycles ⋮ A note on the satisfactory partition problem: constant size requirement ⋮ A characterization of graphs with no cube minor ⋮ Internally 4-connected binary matroids without a prism+\(e\) minor ⋮ On regular matroids without certain minors ⋮ Restricted cycle factors and arc-decompositions of digraphs

This page was built for publication: