On the public citation graph
Binary group and Chinese postman polyhedra
0 signed · 42 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/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01580121openalex-snapshot
On the facial structure of set packing polyhedra
inferredcites →https://doi.org/10.1016/0024-3795(69)90017-2openalex-snapshot
Some polyhedra related to combinatorial problems
inferredcites →https://doi.org/10.1016/0095-8956(77)90031-4openalex-snapshot
The matroids with the max-flow min-cut property
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0167-6377(81)90020-1openalex-snapshot
Weakly bipartite graphs and the Max-cut problem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70855-0openalex-snapshot
On Tutte's Characterization of Graphic Matroids
inferredcites →https://doi.org/10.1090/notiopenalex-snapshot
Notices of the American Mathematical Society
inferredcites →https://doi.org/10.1090/procopenalex-snapshot
Proceedings of the American Mathematical Society
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0117173-5openalex-snapshot
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
inferredcites →https://doi.org/10.1090/s0002-9947-1932-1501641-2openalex-snapshot
Non-separable and planar graphs
inferredcites →https://doi.org/10.1112/plms/s3-38.3.423openalex-snapshot
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
inferredcites →https://doi.org/10.1137/0112059openalex-snapshot
A Solution of the Shannon Switching Game
inferredcites →https://doi.org/10.1137/0602027openalex-snapshot
Some Results on Polyhedra of Semigroup Problems
inferredcites →https://doi.org/10.1137/0606016openalex-snapshot
Mappings and Facets for Nonabelian Group Problems
inferredcites →https://doi.org/10.1287/moor.5.3.321openalex-snapshot
Converting Linear Programs to Network Problems
inferredcites →https://doi.org/10.1287/moor.6.1.101openalex-snapshot
On the Generality of the Subadditive Characterization of Facets
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.1007/978-1-4615-4495-1_5openalex-snapshot
Chinese Postman and Euler Tour Problems in Bi-Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-981-13-0680-8_3openalex-snapshot
Modified SA Algorithm for Bi-objective Robust Stochastic Cellular Facility Layout in Cellular Manufacturing Systems
inferred← citeshttps://doi.org/10.1007/bf01582275openalex-snapshot
Polyhedra of regularp-nary group problems
inferred← citeshttps://doi.org/10.1007/bf01589109openalex-snapshot
Four problems on graphs with excluded minors
inferred← citeshttps://doi.org/10.1007/bf02592014openalex-snapshot
Dual row modules and polyhedra of blocking group problems
inferred← citeshttps://doi.org/10.1007/bfb0083462openalex-snapshot
On binary group problems having the Fulkerson property
inferred← citeshttps://doi.org/10.1007/s10107-003-0402-xopenalex-snapshot
Binary clutter inequalities for integer programs
inferred← citeshttps://doi.org/10.1007/s10479-006-0109-5openalex-snapshot
My experiences as a student and researcher in OR during the 1960’s and 70’s
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90133-zopenalex-snapshot
Compositions in the bipartite subgraph polytope
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90063-8openalex-snapshot
On the cycle polytope of a binary matroid
inferred← citeshttps://doi.org/10.1016/j.orl.2013.09.009openalex-snapshot
Binary group facets with complete support and non-binary coefficients
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80109-4openalex-snapshot
Chapter 5 Arc routing methods and applications
inferred← citeshttps://doi.org/10.1109/isit.2008.4594976openalex-snapshot
A branch and cut algorithm for finding the minimum distance of a linear block code
inferred← citeshttps://doi.org/10.1109/tcomm.2010.04.090164openalex-snapshot
Minimum distance computation of LDPC codes using a branch and cut algorithm
inferred← citeshttps://doi.org/10.37236/29openalex-snapshot
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
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.