On the public citation graph
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
0 signed · 50 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01588228openalex-snapshot
Minimum node covers and 2-bicritical graphs
inferredcites →https://doi.org/10.1016/0012-365x(80)90002-3openalex-snapshot
A matching problem with side conditions
inferredcites →https://doi.org/10.1016/0095-8956(71)90041-4openalex-snapshot
Perfect matchings of a graph
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0304-0208(08)72442-3openalex-snapshot
The Travelling Salesman Polytope and {0, 2}-Matchings
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230130408openalex-snapshot
Dynamic matchings and quasidynamic fractional matchings. II
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_11openalex-snapshot
A TDI Description of Restricted 2-Matching Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_15openalex-snapshot
Triangle-Free 2-Matchings Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_40openalex-snapshot
A Faster Algorithm for the Maximum Even Factor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_56openalex-snapshot
Subgraph Packing — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_25openalex-snapshot
Hypo-matchings in Directed Graphs
inferred← citeshttps://doi.org/10.1007/bf01580854openalex-snapshot
Solving the linear matroid parity problem as a sequence of matroid intersection problems
inferred← citeshttps://doi.org/10.1007/s00373-020-02228-yopenalex-snapshot
Ear-Slicing for Matchings in Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02266-6openalex-snapshot
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
inferred← citeshttps://doi.org/10.1007/s00493-007-2131-xopenalex-snapshot
Matchings of cycles and paths in directed graphs
inferred← citeshttps://doi.org/10.1007/s10107-008-0211-3openalex-snapshot
Weighted restricted 2-matching
inferred← citeshttps://doi.org/10.1007/s10801-024-01353-8openalex-snapshot
A unified combinatorial view beyond some spectral properties
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90085-7openalex-snapshot
An extension of matching theory
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90053-9openalex-snapshot
Fractional matchings and the Edmonds-Gallai theorem
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90115-qopenalex-snapshot
Structural properties of matroid matchings
inferred← citeshttps://doi.org/10.1016/0167-6377(82)90016-5openalex-snapshot
Packing subgraphs in a graph
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.07.001openalex-snapshot
The strength of Dantzig–Wolfe reformulations for the stable set and related problems
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.06.013openalex-snapshot
A construction for non-rank facets of stable set polytopes of webs
inferred← citeshttps://doi.org/10.1111/itor.12275openalex-snapshot
Characterizing ‐perfect line graphs
inferred← citeshttps://doi.org/10.1137/0607024openalex-snapshot
Packings by Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/16m1092921openalex-snapshot
Packing $k$-Matchings and $k$-Critical Graphs
inferred← citeshttps://doi.org/10.1142/s1793830910000930openalex-snapshot
TRIANGLE-FREE 2-MATCHINGS REVISITED
inferred← citeshttps://doi.org/10.1287/moor.2013.0624openalex-snapshot
The Nonnegative Node Weight j -Restricted k -Matching Problems
inferred← citeshttps://doi.org/10.37236/1905openalex-snapshot
The Edmonds-Gallai Decomposition for the $k$-Piece Packing Problem
inferred← citeshttps://doi.org/10.37236/7837openalex-snapshot
An Edmonds-Gallai-Type Decomposition for the j-Restricted k-Matching Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1003.2697openalex-snapshot
Triangle-Free 2-Matchings Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04072openalex-snapshot
Characterizing N+-perfect line graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11302openalex-snapshot
Color-critical Graphs and Hereditary Hypergraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.