scientific article; zbMATH DE number 3215864
From MaRDI portal
zbMath0133.16701MaRDI QIDQ5342984
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Ramsey number of paths and connected matchings in Ore-type host graphs, Disjoint complete minors and bipartite minors, Chordal editing is fixed-parameter tractable, Scattered packings of cycles, Nearly sign-nonsingular matrices, Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids, Efficient enumeration of graph orientations with sources, On independent cycles and edges in graphs, A tight Erdős-Pósa function for long cycles, The confirmation of a conjecture on disjoint cycles in a graph, The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces, Approximate min-max relations on plane graphs, Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs, An \(A_\alpha\)-spectral Erdős-Pósa theorem, The Erdős-Pósa property for clique minors in highly connected graphs, A note on disjoint cycles, Lipschitz-free Spaces on Finite Metric Spaces, Rooted prism-minors and disjoint cycles containing a specified edge, Disjoint cocircuits in matroids with large rank, The total chromatic number of graphs of even order and high degree, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem, Minimum degree conditions for vertex-disjoint even cycles in large graphs, A naive algorithm for feedback vertex set, A condition for a graph to contain \(k\)-matching., The number of circuits of length 4 inPSL(2,ℤ)-space, Disjoint unions of complete minors, On feedback vertex set: new measure and new structures, The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs, On the maximal number of independent circuits in a graph, Packing edge-disjoint cycles in graphs and the cyclomatic number, Packing disjoint cycles over vertex cuts, Non-zero disjoint cycles in highly connected group labelled graphs, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Closest 4-leaf power is fixed-parameter tractable, On the minors of an incidence matrix and Smith normal form, Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3, Minimum weakly fundamental cycle bases are hard to find, Linear connectivity forces large complete bipartite minors, Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs, Packing and Covering Induced Subdivisions, Erdös--Pósa Property for Labeled Minors: 2-Connected Minors, A two-person game on graphs where each player tries to encircle his opponent's men, Distance spectrum, 1-factor and vertex-disjoint cycles, The total chromatic number of regular graphs of high degree, Graphs without two vertex-disjoint \(S\)-cycles, Approximating minimum feedback vertex sets in hypergraphs, Disjoint Even Cycles Packing, The total chromatic number of regular graphs of even order and high degree, Total chromatic number of graphs of odd order and high degree, Maximum cycle packing using SPR-trees, Totally critical even order graphs, Unnamed Item, Unnamed Item, Non-zero disjoint cycles in highly connected group labeled graphs
