scientific article
From MaRDI portal
Publication:3258698
zbMath0086.16301MaRDI QIDQ3258698
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Size of Matchings in 1-Planar Graph with High Minimum Degree, Precoloring extension involving pairs of vertices of small distance, Irreducible triangulations of surfaces with boundary, Packings by Complete Bipartite Graphs, THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH, Connective Steiner 3-eccentricity index and network similarity measure, A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion, Unnamed Item, The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number, Spectral extrema of graphs with bounded clique number and matching number, A complete description of convex sets associated with matchings and edge‐connectivity in graphs, The maximum number of triangles in \(F_k\)-free graphs, Matchings in 1‐planar graphs with large minimum degree, Finding Maximum Edge-Disjoint Paths Between Multiple Terminals, Strong chromatic index and Hadwiger number, Eigenvalues and [a,b‐factors in regular graphs], A note on maximum size of a graph without isolated vertices under the given matching number, Matchings in graphs from the spectral radius, A note on the minimum size of matching-saturated graphs, Ramsey numbers of large even cycles and fans, Saturation numbers for linear forests $P_6 + tP_2$, Transversals in regular uniform hypergraphs, The Tuza–Vestergaard Theorem, On the structure of factorizable graphs, On defect restricted matching extension graphs, Packing $k$-Matchings and $k$-Critical Graphs, A Hall-type theorem with algorithmic consequences in planar graphs, Spectral conditions for graphs to be β-deficient involving minimum degree, The binding number of a graph and its Anderson number, Illumination in the presence of opaque line segments in the plane, Approximate proof-labeling schemes, Über ein graphentheoretisches Ergebnis von T. Gallai, On the order of certain close to regular graphs without a matching of given size, Unnamed Item, On the Chromatic Number of Matching Kneser Graphs, Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm, Unnamed Item, Nearly Perfect Matchings in Uniform Hypergraphs, The Nonnegative Node Weight j-Restricted k-Matching Problems, Unnamed Item, A hypergraph version of the Gallai-Edmonds Theorem, The maximal Aα-spectral radius of graphs with given matching number, The maximum genus, matchings and the cycle space of a graph, Guarding disjoint triangles and claws in the plane, Ramsey number of paths and connected matchings in Ore-type host graphs, Spectral radius and fractional matchings in graphs, A generalisation of matching and colouring, Generalization of matching extensions in graphs. II., Tutte sets in graphs. II: The complexity of finding maximum Tutte sets, Characterization of saturated graphs related to pairs of disjoint matchings, Protecting convex sets, Spanning trails with variations of Chvátal-Erdős conditions, The maximum number of edges in a 3-graph not containing a given star, Undirected distances and the postman-structure of graphs, Packing seagulls, Generalization of matching extensions in graphs. IV: Closures, Matchings in benzene chains, Spectral radius of graphs with given matching number, Large matchings from eigenvalues, Combinatorial games on a graph, Claw-free graphs. VI: Colouring, Smallest close to regular bipartite graphs without an almost perfect matching, Decomposition theorems for square-free 2-matchings in bipartite graphs, Lower bounds on the cardinality of the maximum matchings of planar graphs, An odd \([ 1 , b \)-factor in regular graphs from eigenvalues], Matching and edge-connectivity in regular graphs, Additive stabilizers for unstable graphs, An algorithmic approach to dual integrality of matching and extensions, The total eccentricity sum of non-adjacent vertex pairs in graphs, Saturation numbers for linear forests \(P_5\cup tP_2\), Matroid matching and some applications, On the graphic matroid parity problem, Strong matching preclusion number of graphs, Matrices of zeros and ones with fixed row and column sum vectors, f-factors and related decompositions of graphs, Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2, On generalized matching problems, Higher-order triangular-distance Delaunay graphs: graph-theoretical properties, Cardinality constrained combinatorial optimization: complexity and polyhedra, Location-domination and matching in cubic graphs, The difference and ratio of the fractional matching number and the matching number of graphs, A new linear programming algorithm - better or worse than the simplex method?, Polyhedron of triangle-free simple 2-matchings in subcubic graphs, On the maximum matchings of regular multigraphs, A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem, Chvátal-Erdős conditions and almost spanning trails, Matching preclusion number of graphs, Solving MAX-\(r\)-SAT above a tight lower bound, Indestructive deletions of edges from graphs, A note on 1-planar graphs with minimum degree 7, Bi-criteria and approximation algorithms for restricted matchings, Maximum \((g,f)\)-factors of a general graph, Improved bounds on the multicolor Ramsey numbers of paths and even cycles, Some extremal results on the connective eccentricity index of graphs, On saturation games, Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs, Matching theory -- a sampler: From Dénes König to the present, Spanning closed trails in graphs, Matroid matching with Dilworth truncation, Efficient stabilization of cooperative matching games, Generalization of matching extensions in graphs. III, On defect-d matchings in graphs, A pair of forbidden subgraphs and perfect matchings., Graphs with maximal Hosoya index and minimal Merrifield-Simmons index, Degrees and matchings, Développements recents de la théorie des graphes, On maximal energy of line graphs with given parameters, Finding maximum square-free 2-matchings in bipartite graphs, Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers, A note on parity constrained orientations, Sur le nombre transversal des hypergraphes uniformes, Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph, An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem, Matchings in regular graphs from eigenvalues, Conditional matching preclusion sets, Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number, On the odd-minor variant of Hadwiger's conjecture, An extension of Tutte's 1-factor theorem, Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs, The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs, On the relationship between the genus and the cardinality of the maximum matchings of a graph, A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree, A tight lower bound on the matching number of graphs via Laplacian eigenvalues, 1-Faktoren von Graphen. (1-factors of graphs), Maximum balanced flow in a network, Bounds on maximum \(b\)-matchings, Disjoint \(A\)-paths in digraphs, Linear-time certifying algorithms for near-graphical sequences, Note on matching preclusion number of random graphs, Short proofs on the matching polyhedron, Matchings in pentagonal chains, Stirling numbers and records, The Edmonds-Gallai decomposition for matchings in locally finite graphs, Maximum matching in almost linear time on graphs of bounded clique-width, A short proof of Mader's \(\mathcal S\)-paths theorem, On the chromatic number of certain highly symmetric graphs, Sharp lower bounds on the fractional matching number, Spaces of symmetric matrices of bounded rank, Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs, Triangles and (total) domination in subcubic graphs, Group connectivity and matchings, Matchings in higher-order Gabriel graphs, Some extremal graphs with respect to inverse degree
