On the public citation graph

Minimum node covers and 2-bicritical graphs

https://doi.org/10.1007/bf01588228
0 signed · 51 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-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bf01593772openalex-snapshot
On the integer-valued variables in the linear vertex packing problem
inferredcites →https://doi.org/10.1007/bfb0120895openalex-snapshot
Dual integrality in b-matching problems
inferredcites →https://doi.org/10.1017/s0305004100051124openalex-snapshot
On colouring random graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08785-1openalex-snapshot
Some remarks on the theory of graphs
inferredcites →https://doi.org/10.1137/0206046openalex-snapshot
Determining the Stability Number of a Graph
inferredcites →https://doi.org/10.1137/0208001openalex-snapshot
Determining the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1287/mnsc.12.3.253openalex-snapshot
Integer Programming: Methods, Uses, Computations
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.1007/3-540-10704-5_10openalex-snapshot
Some common properties for regularizable graphs, edge-critical graphs and b-graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_27openalex-snapshot
Persistency of Linear Programming Relaxations for the Stable Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
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/bf02591862openalex-snapshot
A decomposition algorithm for linear relaxation of the weightedr-covering problem
inferred← citeshttps://doi.org/10.1007/bfb0120895openalex-snapshot
Dual integrality in b-matching problems
inferred← citeshttps://doi.org/10.1007/s00493-025-00144-4openalex-snapshot
Sets of r-Graphs that Color All r-Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90282-kopenalex-snapshot
The core of a graph
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90076-6openalex-snapshot
An exact threshold theorem for random graphs and the node-packing problem
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90273-dopenalex-snapshot
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
inferred← citeshttps://doi.org/10.1016/0167-6377(85)90024-0openalex-snapshot
Random near-regular graphs and the node packing problem
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.dam.2007.03.026openalex-snapshot
Crown reductions for the Minimum Weighted Vertex Cover problem
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.014openalex-snapshot
Sharp lower bounds on the fractional matching number
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.005openalex-snapshot
The difference and ratio of the fractional matching number and the matching number of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115432openalex-snapshot
Determinantal multiplicativity in the independence decomposition of a graph
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.08.008openalex-snapshot
Berge’s theorem for the maximum charge problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.02.004openalex-snapshot
Spectral radius and fractional matchings in graphs
inferred← citeshttps://doi.org/10.1016/j.sorms.2010.07.001openalex-snapshot
Heuristics based on mathematical programming
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00188-xopenalex-snapshot
Capacities of graphs and 2-matchings
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00181-xopenalex-snapshot
Pseudo-Hamiltonian-connected graphs
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)73488-1openalex-snapshot
Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73649-1openalex-snapshot
References
inferred← citeshttps://doi.org/10.1017/nws.2015.8openalex-snapshot
Vulnerability and power on networks
inferred← citeshttps://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferred← citeshttps://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848130openalex-snapshot
LP-relaxation based distributed algorithms for scheduling in wireless networks
inferred← citeshttps://doi.org/10.1137/0603052openalex-snapshot
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
inferred← citeshttps://doi.org/10.1287/opre.2018.1763openalex-snapshot
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
inferred← citeshttps://doi.org/10.1287/opre.2019.1970openalex-snapshot
Why Is Maximum Clique Often Easy in Practice?
inferred← citeshttps://doi.org/10.1287/opre.28.4.847openalex-snapshot
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
inferred← citeshttps://doi.org/10.2139/ssrn.6102549openalex-snapshot
König–Egerváry and Sterboul–Deming Properties in Graph Products
inferred← citeshttps://doi.org/10.48550/arxiv.1312.5598openalex-snapshot
Vulnerability and power on networks
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03990openalex-snapshot
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
inferred← citeshttps://doi.org/10.7151/dmgt.2317openalex-snapshot
New results relating inependence and matchings
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.