TWO THEOREMS IN GRAPH THEORY
From MaRDI portal
Publication:3258697
Cited in
(only showing first 100 items - show all)- Bipartite graphs totally decomposable by canonical decomposition
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- Berge's theorem for the maximum charge problem
- Finding maximum square-free 2-matchings in bipartite graphs
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT
- Using relations to develop a Haskell program for computing maximum bipartite matchings
- Path problems in skew-symmetric graphs
- Stabilizing network bargaining games by blocking players
- Variations on a theorem of Petersen
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Finding maximum matching for bipartite graphs in parallel
- On some algorithmic investigations of star partitions of graphs
- Large matchings in maximal 1-planar graphs
- Complete subgraphs of the coprime hypergraph of integers. III: Construction
- Perfect matchings as IID factors on non-amenable groups
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- scientific article; zbMATH DE number 7622570 (Why is no real title available?)
- Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
- Julius Petersen's theory of regular graphs
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
- An introduction to randomized algorithms
- On maximum matchings in cubic graphs with a bounded number of bridge-covering paths
- Augmenting graphs for independent sets
- Finding a maximum matching in a circular-arc graph
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs
- Nash equilibria in the two-player kidney exchange game
- Maximum and optimal 1-2 matching problem of the different kind
- A characterization of König-Egerváry graphs with extendable vertex covers
- Covers, matchings and odd cycles of a graph
- The extremal values of some topological indices in bipartite graphs with a given matching number
- Finding triangle-free 2-factors in general graphs
- On complexity of special maximum matchings constructing
- The maximum 1-2 matching problem and two kinds of its variants
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- scientific article; zbMATH DE number 1769330 (Why is no real title available?)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete
- On adaptive algorithms for maximum matching
- Supereulerian digraphs with large arc-strong connectivity
- Combinatorial Aspects in Sparse Elimination Methods
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Maximum \((g,f)\)-factors of a general graph
- Allocating costs in set covering problems
- Fair-by-design matching
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Toughness in graphs -- a survey
- Cayley factorization and the area principle
- The graphs with maximum induced matching and maximum matching the same size
- Linear time approximation algorithms for~degree~constrained subgraph problems
- An Algorithm for a Minimum Cover of a Graph
- Heuristically guided search and chromosome matching
- Benders decomposition for network design covering problems
- A survey of direct methods for sparse linear systems
- Hierarchical \(b\)-matching
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Perfect matching in random graphs is as hard as Tseitin
- An efficient distributed algorithm for maximum matching in general graphs
- A condition on Hamilton-connected line graphs
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- On two extensions of equimatchable graphs
- Tiling with Squares and Packing Dominos in Polynomial Time
- Recomputing causality assignments on lumped process models when adding new simplification assumptions
- Bipartite matching in the semi-streaming model
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets
- Bottleneck partial-matching Voronoi diagrams and applications
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- Packings by Complete Bipartite Graphs
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Structural identifiability in low-rank matrix factorization
- Augmenting approach for some maximum set problems
- On generalized matching problems
- Covers and packings in a family of sets
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- Matching and spanning trails in digraphs
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- On improving matchings in trees, via bounded-length augmentations
- Erdős-Ko-Rado for perfect matchings
- Forbidden subgraphs and the König-Egerváry property
- Augmenting trail theorem for the maximum 1-2 matching problem
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Stabilizing network bargaining games by blocking players
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
- ``Global graph problems tend to be intractable
- A polynomial time solvable instance of the feasible minimum cover problem
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Tight bounds on maximal and maximum matchings
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- On finding augmenting graphs
- Gallai-Edmonds decomposition as a pruning technique
- Augmenting chains in graphs without a skew star.
- New approximation results on graph matching and related problems
- Finding a maximum matching in a permutation graph
- Linear-time certifying algorithms for near-graphical sequences
- scientific article; zbMATH DE number 7651215 (Why is no real title available?)
This page was built for publication: TWO THEOREMS IN GRAPH THEORY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3258697)
