scientific article; zbMATH DE number 863471
From MaRDI portal
Publication:4871750
zbMath0866.05048MaRDI QIDQ4871750
Publication date: 8 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (33)
Guarding disjoint triangles and claws in the plane ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Matchings, path covers and domination ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Incremental assignment problem ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Perfect matchings and ears in elementary bipartite graphs ⋮ The Generalized Popular Condensation Problem ⋮ Dynamic rank-maximal and popular matchings ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ Popular matchings with variable item copies ⋮ On matching and semitotal domination in graphs ⋮ On maximum matchings in König-Egerváry graphs ⋮ Rank-maximal matchings -- structure and algorithms ⋮ The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ Induced cycles in graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Tight lower bounds on the size of a maximum matching in a regular graph ⋮ 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 ⋮ Popularity at minimum cost ⋮ A characterization of graphs with given maximum degree and smallest possible matching number ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ Metabolic networks are NP-hard to reconstruct ⋮ On mod \((2p+1)\)-orientations of graphs ⋮ Matching, path covers, and total forcing sets ⋮ Zero forcing in claw-free cubic graphs ⋮ Path hitting in acyclic graphs ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ Systems of distant representatives in Euclidean space ⋮ Reduced 2-to-1 maps and decompositions of graphs with no 2-to-1 cut sets
This page was built for publication:
