scientific article; zbMATH DE number 863471
From MaRDI portal
Publication:4871750
Recommendations
Cited in
(47)- On mod \((2p+1)\)-orientations of graphs
- Path hitting in acyclic graphs
- Matching theory
- Infinite matching theory
- Matching theory -- a sampler: From Dénes König to the present
- Perfect matchings and ears in elementary bipartite graphs
- Binding number conditions for matching extension
- Metabolic networks are NP-hard to reconstruct
- Reduced 2-to-1 maps and decompositions of graphs with no 2-to-1 cut sets
- Guarding disjoint triangles and claws in the plane
- A characterization of graphs with given maximum degree and smallest possible matching number
- Matching and edge-connectivity in graphs with given maximum degree
- Minimum cost b-matching problems with neighborhoods
- Extendability and criticality in matching theory
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Zero forcing in claw-free cubic graphs
- Systems of distant representatives in Euclidean space
- Dynamic rank-maximal and popular matchings
- On matching and semitotal domination in graphs
- On maximum matchings in König-Egerváry graphs
- Tight lower bounds on the size of a maximum matching in a regular graph
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- The generalized popular condensation problem
- Matchings, path covers and domination
- Matching theory
- Popular matchings with two-sided preferences and one-sided ties
- Matching Extendability in Hypercubes
- scientific article; zbMATH DE number 4025456 (Why is no real title available?)
- scientific article; zbMATH DE number 568824 (Why is no real title available?)
- scientific article; zbMATH DE number 1123785 (Why is no real title available?)
- scientific article; zbMATH DE number 6863588 (Why is no real title available?)
- Induced cycles in graphs
- Matching, path covers, and total forcing sets
- p-matchings in graphs: a brief survey with some open problems
- Popular matchings with two-sided preferences and one-sided ties
- Conjectures of TxGraffiti: independence, domination, and matchings
- Interleavings and matchings as representations
- Envy-free matchings in bipartite graphs and their applications to fair division
- Popular matchings with variable item copies
- Local edge metric dimensions via corona products and integer linear programming
- On a conjecture that strengthens Kundu's k-factor theorem
- Popular solutions for optimal matchings
- The 1-nearly edge independence number of a graph
- Incremental assignment problem
- Graph factors and factorization: 1985--2003: a survey
- Bounds relating the weakly connected domination number to the total domination number and the matching number
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
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 Q4871750)
