scientific article; zbMATH DE number 3141016
From MaRDI portal
Publication:3258698
Cited in
(only showing first 100 items - show all)- Location-domination and matching in cubic graphs
- The total eccentricity sum of non-adjacent vertex pairs in graphs
- Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
- An extension of Tutte's 1-factor theorem
- Matching preclusion number of graphs
- Strong chromatic index and Hadwiger number
- A Hall-type theorem with algorithmic consequences in planar graphs
- Undirected distances and the postman-structure of graphs
- scientific article; zbMATH DE number 3679881 (Why is no real title available?)
- From princes on chessboards to proper total domination in graphs
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Matroid matching and some applications
- A unified combinatorial view beyond some spectral properties
- On the chromatic number of matching Kneser graphs
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- A note on 1-planar graphs with minimum degree 7
- Generalization of matching extensions in graphs. IV: Closures
- Chvátal-Erdős conditions and almost spanning trails
- On the odd-minor variant of Hadwiger's conjecture
- Finding maximum square-free 2-matchings in bipartite graphs
- On the relationship between the genus and the cardinality of the maximum matchings of a graph
- Additive stabilizers for unstable graphs
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Rainbow triangles sharing one common vertex or edge
- A note on maximum size of a graph without isolated vertices under the given matching number
- On the chromatic number of certain highly symmetric graphs
- A spectral generalized Alon-Frankl theorem
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree
- Note on matching preclusion number of random graphs
- Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
- Total coloring graphs with large maximum degree
- Bounds on maximum \(b\)-matchings
- Stirling numbers and records
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- The difference and ratio of the fractional matching number and the matching number of graphs
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Combinatorial games on a graph
- Some extremal results on the connective eccentricity index of graphs
- Matchings in pentagonal chains
- Strong matching preclusion number of graphs
- On the graphic matroid parity problem
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Characterizing defect n-extendable graphs and (2n+1)-critical graphs
- Spanning closed trails in graphs
- On the structure of factorizable graphs
- Maximum balanced flow in a network
- Irreducible triangulations of surfaces with boundary
- Generalization of matching extensions in graphs. III
- Spectral radius of graphs with given matching number
- Packing $k$-Matchings and $k$-Critical Graphs
- A new linear programming algorithm - better or worse than the simplex method?
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- Finding triangle-free 2-factors in general graphs
- Matchings in 1‐planar graphs with large minimum degree
- An algorithmic approach to dual integrality of matching and extensions
- Triangles and (total) domination in subcubic graphs
- Short proofs on the matching polyhedron
- The binding number of a graph and its Anderson number
- A note on the minimum size of matching-saturated graphs
- Regularity of normal Rees algebras of edge ideals of graphs
- Maximum \((g,f)\)-factors of a general graph
- Efficient stabilization of cooperative matching games
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
- Matchings in graphs from the spectral radius
- The maximum number of triangles in \(F_k\)-free graphs
- Extremal problems for a matching and any other graph
- Spanning trails with variations of Chvátal-Erdős conditions
- Développements recents de la théorie des graphes
- A note on parity constrained orientations
- Matching and edge-connectivity in regular graphs
- Matchings in higher-order Gabriel graphs
- Some extremal graphs with respect to inverse degree
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Guarding disjoint triangles and claws in the plane
- Sur le nombre transversal des hypergraphes uniformes
- Saturation numbers for linear forests $P_6 + tP_2$
- The maximum number of edges in a 3-graph not containing a given star
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
- Conditional matching preclusion sets
- Approximate proof-labeling schemes
- On the order of certain close to regular graphs without a matching of given size
- Sharp lower bounds on the fractional matching number
- Generalization of matching extensions in graphs. II.
- Spectral radius and fractional matchings in graphs
- Transversals in regular uniform hypergraphs
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Solving MAX-\(r\)-SAT above a tight lower bound
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Nearly perfect matchings in uniform hypergraphs
- On the maximum matchings of regular multigraphs
- Packings by Complete Bipartite Graphs
- On defect-d matchings in graphs
- The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
- A generalisation of matching and colouring
- On generalized matching problems
- Large matchings from eigenvalues
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Cardinality constrained combinatorial optimization: complexity and polyhedra
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)
