On the public citation graph

A characterization of graphs with vertex cover up to five

https://doi.org/10.1007/bfb0019428

0 signed · 26 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/3-540-54233-7_161openalex-snapshot

Finding minimal forbidden minors using a finite congruence

inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_7openalex-snapshot

Parameterized Computational Feasibility

inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot

Graph Problems Related to Gate Matrix Layout and PLA Folding

inferredcites →https://doi.org/10.1007/bfb0017382openalex-snapshot

An algebraic theory of graph reduction

inferredcites →https://doi.org/10.1016/0012-365x(74)90042-9openalex-snapshot

On simple characterizations of k-trees

inferredcites →https://doi.org/10.1016/0166-218x(92)90208-ropenalex-snapshot

Narrowness, pathwidth, and their application in natural language processing

inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot

Easy problems for tree-decomposable graphs

inferredcites →https://doi.org/10.1017/cbo9781107325678.009openalex-snapshot

Graph minors – a survey

inferredcites →https://doi.org/10.1109/sfcs.1989.63528openalex-snapshot

An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations

inferredcites →https://doi.org/10.1145/167088.167161openalex-snapshot

A linear time algorithm for finding tree-decompositions of small treewidth

inferredcites →https://doi.org/10.7936/k77p8wqhopenalex-snapshot

Graph Separation and Search Number

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-44968-x_18openalex-snapshot

A Characterization of Graphs with Vertex Cover Six

inferred← citeshttps://doi.org/10.1007/3-540-60220-8_81openalex-snapshot

Obstructions to within a few vertices or edges of acyclic

inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_17openalex-snapshot

Well-Quasi-Orderings and the Robertson–Seymour Theorems

inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_19openalex-snapshot

Applications of the Obstruction Principle and WQOs

inferred← citeshttps://doi.org/10.1007/bfb0019422openalex-snapshot

Orders, Algorithms, and Applications

inferred← citeshttps://doi.org/10.1007/s00453-006-1214-1openalex-snapshot

Scalable Parallel Algorithms for FPT Problems

inferred← citeshttps://doi.org/10.1007/s11786-007-0038-yopenalex-snapshot

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems

inferred← citeshttps://doi.org/10.1016/0020-0190(95)00190-5openalex-snapshot

A simple linear-time algorithm for finding path-decompositions of small width

inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.021openalex-snapshot

Sparse obstructions for minor-covering parameters

inferred← citeshttps://doi.org/10.1016/j.disc.2003.09.007openalex-snapshot

Halin's theorem for cubic graphs on an annulus

inferred← citeshttps://doi.org/10.1016/j.disc.2007.01.003openalex-snapshot

Properties of vertex cover obstructions

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.040openalex-snapshot

Dichotomy results for fixed point counting in boolean dynamical systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00300-9openalex-snapshot

On computing graph minor obstruction sets

inferred← citeshttps://doi.org/10.1137/s0895480195280010openalex-snapshot

The Structure and Number of Obstructions to Treewidth

inferred← citeshttps://doi.org/10.1142/9789812770998_0018openalex-snapshot

DICHOTOMY RESULTS FOR FIXED POINT COUNTING IN BOOLEAN DYNAMICAL SYSTEMS

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.