scientific article; zbMATH DE number 3243269
From MaRDI portal
Publication:5530472
Cited in
(40)- Disjoint directed and undirected paths and cycles in digraphs
- On cyclic edge-connectivity of transitive graphs
- On digraphs with no two disjoint directed cycles
- Biased graphs. II: The three matroids
- On separating cycles in graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Cycle multiplicity of some total graphs
- Biased graphs with no two vertex-disjoint unbalanced cycles
- A characterization of graphs with no cube minor
- Nearly sign-nonsingular matrices
- Spectral threshold for extremal cyclic edge-connectivity
- A note on the satisfactory partition problem: constant size requirement
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Unbreakable matroids
- Disjoint cycles and chorded cycles in a graph with given minimum degree
- Internally 4-connected binary matroids without a prism+\(e\) minor
- On regular matroids without certain minors
- Restricted cycle factors and arc-decompositions of digraphs
- Recognizing a class of bicircular matroids
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5
- Super-cyclically edge-connected regular graphs
- A tight Erdős-Pósa function for long cycles
- Degree-constrained 2-partitions of graphs
- On the problem of finding disjoint cycles and dicycles in a digraph
- Cut dominants and forbidden minors
- On the Corrádi-Hajnal theorem and a question of Dirac
- Vertex-disjoint directed and undirected cycles in general digraphs
- Super cyclically edge connected transitive graphs
- A note on disjoint cycles
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- On several sorts of connectivity
- Atoms of cyclic edge connectivity in regular graphs
- Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- Rooted prism-minors and disjoint cycles containing a specified edge
- The structure of metrizable graphs
- On the saturation spectrum of the unions of disjoint cycles
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- Graphs without two vertex-disjoint S-cycles
- Edge reductions in cyclically \(k\)-connected cubic graphs
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 Q5530472)