On the public citation graph

Perfect triangle-free 2-matchings

https://doi.org/10.1007/bfb0120901
0 signed · 35 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.
Claim with ORCID
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.
See reference health

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_13openalex-snapshot
The Factors of Graphs
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0012-365x(80)90002-3openalex-snapshot
A matching problem with side conditions
inferredcites →https://doi.org/10.4153/cjm-1952-028-2openalex-snapshot
The Factors of 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/jgt.23089openalex-snapshot
Finding triangle‐free 2‐factors in general graphs
inferred← citeshttps://doi.org/10.1002/net.22163openalex-snapshot
Node based compact formulations for the Hamiltonian p ‐median problem
inferred← citeshttps://doi.org/10.1002/net.3230130408openalex-snapshot
Dynamic matchings and quasidynamic fractional matchings. II
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_22openalex-snapshot
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles
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-33090-2_26openalex-snapshot
A Model for Minimizing Active Processor Time
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/bf01590960openalex-snapshot
Applying Lehman's theorems to packing problems
inferred← citeshttps://doi.org/10.1007/bf02579340openalex-snapshot
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
inferred← citeshttps://doi.org/10.1007/s00373-010-0906-0openalex-snapshot
Induced Graph Packing Problems
inferred← citeshttps://doi.org/10.1007/s00453-013-9807-yopenalex-snapshot
A Model for Minimizing Active Processor Time
inferred← citeshttps://doi.org/10.1007/s10107-021-01661-yopenalex-snapshot
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles
inferred← citeshttps://doi.org/10.1007/s40305-021-00357-6openalex-snapshot
Remarks on Component Factors
inferred← citeshttps://doi.org/10.1007/s40305-023-00485-1openalex-snapshot
Tight Toughness, Isolated Toughness and Binding Number Bounds for the $$\{K_2,C_n\}$$-Factors
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90115-qopenalex-snapshot
Structural properties of matroid matchings
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.ejc.2017.07.008openalex-snapshot
A fast scaling algorithm for the weighted triangle-free 2-matching problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106146openalex-snapshot
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73649-1openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot
Chapter 3 Matching
inferred← citeshttps://doi.org/10.1051/ro/2025169openalex-snapshot
Tight toughness, isolated toughness and binding number bounds for ( 𝒜, n )-critical deleted graphs
inferred← citeshttps://doi.org/10.1142/s1793830910000930openalex-snapshot
TRIANGLE-FREE 2-MATCHINGS REVISITED
inferred← citeshttps://doi.org/10.1142/s1793830916500403openalex-snapshot
Multiplicative Zagreb indices of cacti
inferred← citeshttps://doi.org/10.1201/b16132-22openalex-snapshot
Chinese Postman Problems
inferred← citeshttps://doi.org/10.1201/b16132-32openalex-snapshot
Factors and Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.1003.2697openalex-snapshot
Triangle-Free 2-Matchings Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1208.0312openalex-snapshot
A Model for Minimizing Active Processor Time
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.