TWO THEOREMS IN GRAPH THEORY

Cited In (only showing first 100 items - show all)

Toughness in graphs -- a survey
The graphs with maximum induced matching and maximum matching the same size
An Algorithm for a Minimum Cover of a Graph
Heuristically guided search and chromosome matching
A survey of direct methods for sparse linear systems
Benders decomposition for network design covering problems
Hierarchical \(b\)-matching
Tiling with Squares and Packing Dominos in Polynomial Time
An efficient distributed algorithm for maximum matching in general graphs
An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
On two extensions of equimatchable graphs
Bipartite matching in the semi-streaming model
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
Packings by Complete Bipartite Graphs
Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations
Bottleneck partial-matching Voronoi diagrams and applications
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Augmenting approach for some maximum set problems
On generalized matching problems
Augmenting trail theorem for the maximum 1-2 matching problem
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
``Global graph problems tend to be intractable
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
A polynomial time solvable instance of the feasible minimum cover problem
Tight bounds on maximal and maximum matchings
On finding augmenting graphs
Gallai-Edmonds decomposition as a pruning technique
From matchings to independent sets
Linear-time certifying algorithms for near-graphical sequences
Sparse regular induced subgraphs in \(2P_3\)-free graphs
On maximal independent sets of vertices in claw-free graphs
Supereulerian graphs with constraints on the matching number and minimum degree
Priority matchings revisited
Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Independence and matching numbers of unicyclic graphs from null space
Cardinality of relations with applications
The combinatorics of N. G. de Bruijn
Nonconvergence, undecidability, and intractability in asymptotic problems
Matching theory -- a sampler: From Dénes König to the present
PARALLEL APPROXIMATE MATCHING
Implicit computation of maximum bipartite matchings by sublinear functional operations
On matching cover of graphs
A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
The general maximum matching algorithm of Micali and Vazirani
Dynamic matchings in left vertex weighted convex bipartite graphs
Converting triangulations to quadrangulations
An extension of matching theory
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Composability and controllability of structural linear time-invariant systems: distributed verification
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Stabilizing Network Bargaining Games by Blocking Players
An efficient algorithm for minimumk-covers in weighted graphs
On paths avoding forbidden pairs of vertices in a graph
Finding maximum square-free 2-matchings in bipartite graphs
Finding augmenting chains in extensions of claw-free graphs
Maximum independent sets in subclasses of \(P_{5}\)-free graphs
Path problems in skew-symmetric graphs
Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT
On some algorithmic investigations of star partitions of graphs
Perfect matchings as IID factors on non-amenable groups
Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
On maximum matchings in cubic graphs with a bounded number of bridge-covering paths
An introduction to randomized algorithms
Augmenting graphs for independent sets
Nash equilibria in the two-player kidney exchange game
A characterization of König-Egerváry graphs with extendable vertex covers
The extremal values of some topological indices in bipartite graphs with a given matching number
Title not available (Why is that?)
Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
On complexity of special maximum matchings constructing
Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
Cayley factorization and the area principle
Fair-by-design matching
Perfect matching in random graphs is as hard as Tseitin
A reduction algorithm for the weighted stable set problem in claw-free graphs
A condition on Hamilton-connected line graphs
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
Recomputing causality assignments on lumped process models when adding new simplification assumptions
Triangle strings: structures for augmentation of vertex-disjoint triangle sets
A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
On \((k+1)\)-line graphs of \(k\)-trees and their nullities
Structural identifiability in low-rank matrix factorization
Covers and packings in a family of sets
Matching and spanning trails in digraphs
The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
Erdős-Ko-Rado for perfect matchings
Forbidden subgraphs and the König-Egerváry property
On improving matchings in trees, via bounded-length augmentations
A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
New approximation results on graph matching and related problems

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)