scientific article; zbMATH DE number 3141016
From MaRDI portal
Publication:3258698
Cited in
(only showing first 100 items - show all)- Matchings in regular graphs from eigenvalues
- Conditional matching preclusion sets
- Bounds on maximum \(b\)-matchings
- Linear-time certifying algorithms for near-graphical sequences
- Short proofs on the matching polyhedron
- Stirling numbers and records
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- On the chromatic number of certain highly symmetric graphs
- The maximum number of edges in a 3-graph not containing a given star
- Undirected distances and the postman-structure of graphs
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- Matroid matching and some applications
- 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
- A new linear programming algorithm - better or worse than the simplex method?
- On the maximum matchings of regular multigraphs
- Indestructive deletions of edges from graphs
- Maximum \((g,f)\)-factors of a general graph
- Matching theory -- a sampler: From Dénes König to the present
- On defect-d matchings in graphs
- Degrees and matchings
- Développements recents de la théorie des graphes
- Sur le nombre transversal des hypergraphes uniformes
- An extension of Tutte's 1-factor theorem
- Spaces of symmetric matrices of bounded rank
- Protecting convex sets
- On the graphic matroid parity problem
- Maximum balanced flow in a network
- Strong matching preclusion number of graphs
- Matching preclusion number of graphs
- Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Guarding disjoint triangles and claws in the plane
- A generalisation of matching and colouring
- Combinatorial games on a graph
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
- On maximal energy of line graphs with given parameters
- Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
- The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Maximum matching in almost linear time on graphs of bounded clique-width
- Triangles and (total) domination in subcubic graphs
- Characterization of saturated graphs related to pairs of disjoint matchings
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Chvátal-Erdős conditions and almost spanning trails
- A note on 1-planar graphs with minimum degree 7
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Sharp lower bounds on the fractional matching number
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
- Group connectivity and matchings
- Matchings in higher-order Gabriel graphs
- Generalization of matching extensions in graphs. II.
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- Spanning trails with variations of Chvátal-Erdős conditions
- Packing seagulls
- Decomposition theorems for square-free 2-matchings in bipartite 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
- Bi-criteria and approximation algorithms for restricted matchings
- Matroid matching with Dilworth truncation
- A pair of forbidden subgraphs and perfect matchings.
- Finding maximum square-free 2-matchings in bipartite graphs
- On the odd-minor variant of Hadwiger's conjecture
- Characterizing defect n-extendable graphs and (2n+1)-critical graphs
- 1-Faktoren von Graphen. (1-factors of graphs)
- Disjoint A-paths in digraphs
- Some extremal graphs with respect to inverse degree
- Precoloring extension involving pairs of vertices of small distance
- Irreducible triangulations of surfaces with boundary
- Connective Steiner 3-eccentricity index and network similarity measure
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Spectral radius and fractional matchings in graphs
- Generalization of matching extensions in graphs. IV: Closures
- A hypergraph version of the Gallai-Edmonds Theorem
- On the order of certain close to regular graphs without a matching of given size
- Packings by Complete Bipartite Graphs
- scientific article; zbMATH DE number 3679881 (Why is no real title available?)
- Über ein graphentheoretisches Ergebnis von T. Gallai
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- The maximum genus, matchings and the cycle space of a graph
- Packing $k$-Matchings and $k$-Critical Graphs
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Nearly perfect matchings in uniform hypergraphs
- 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
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree
- THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
- On the chromatic number of matching Kneser graphs
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- Efficient stabilization of cooperative matching games
- Generalization of matching extensions in graphs. III
- On star-packings having a large matching
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 Q3258698)
