Some Results Concerning the Structure of Graphs
From MaRDI portal
Publication:5512793
DOI10.4153/CMB-1963-019-5zbMath0138.19203MaRDI QIDQ5512793
Publication date: 1963
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
A refinement of theorems on vertex-disjoint chorded cycles, On digraphs with no two disjoint directed cycles, The prism-free planar graphs and their cycles bases, Nearly sign-nonsingular matrices, The structure of graphs not topologically containing the Wagner graph, On the Corrádi-Hajnal theorem and a question of Dirac, Binary matroids without prisms, prism duals, and cubes, Disjoint cycles and chorded cycles in a graph with given minimum degree, The structure of graphs with no K3,3 immersion, Vertex-disjoint directed and undirected cycles in general digraphs, The structure of graphs with no W4 immersion, Rooted prism-minors and disjoint cycles containing a specified edge, On the problem of finding disjoint cycles and dicycles in a digraph, The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Cycle multiplicity of some total graphs, Reparameterization invariants for anisotropic Bianchi I cosmology with a massless scalar source, A Sharp Dirac–Erdős Type Bound for Large Graphs, A decomposition theorem for binary matroids with no prism minor, The traveling salesman problem in graphs with some excluded minors, A characterization of some graph classes using excluded minors, The regular matroids with no 5-wheel minor, An excluded minor theorem for the octahedron, Random unlabelled graphs containing few disjoint cycles, Homomorphiesätze für Graphen, Spectral threshold for extremal cyclic edge-connectivity, Cut Dominants and Forbidden Minors, Strengthening Theorems of Dirac and Erdős on Disjoint Cycles, Ein Struktursatz für 2-fach zusammenhängende Graphen mit großer Minimalvalenz, Arc-Disjoint Directed and Undirected Cycles in Digraphs, Intersections of circuits and cocircuits in binary matroids, Contractible circuits in \(3\)-connected graphs, A characterization of graphs with no cube minor, Internally 4-connected binary matroids without a prism+\(e\) minor, On regular matroids without certain minors, A one-dimensional Whitney trick and Kuratowski's graph planarity criterion
