On the public citation graph

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs

0 signed · 45 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.1002/sapm198981179openalex-snapshot
P4‐Reducible Graphs—Class of Uniquely Tree‐Representable Graphs
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_43openalex-snapshot
The PIGs Full Monty – A Floor Show of Minimal Separators
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_22openalex-snapshot
Chordal Probe Graphs
inferredcites →https://doi.org/10.1016/0095-8956(72)90045-7openalex-snapshot
A characterization of perfect graphs
inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90036-aopenalex-snapshot
A tree representation for P4-sparse graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/j.dam.2004.01.011openalex-snapshot
A simple linear time algorithm for cograph recognition
inferredcites →https://doi.org/10.1016/s0166-218x(98)00077-8openalex-snapshot
On probe interval graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72921-9openalex-snapshot
Diperfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7148-8openalex-snapshot
Topics on Perfect Graphs
inferredcites →https://doi.org/10.1017/cbo9780511542985openalex-snapshot
Tolerance Graphs
inferredcites →https://doi.org/10.1093/bioinformatics/10.3.309openalex-snapshot
An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA
inferredcites →https://doi.org/10.1109/sfcs.2003.1238177openalex-snapshot
A polynomial algorithm for recognizing perfect graphs
inferredcites →https://doi.org/10.1137/0206036openalex-snapshot
A New Algorithm for Generating All the Maximal Independent Sets
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
inferredcites →https://doi.org/10.1137/0221027openalex-snapshot
Recognizing $P_4 $-Sparse Graphs in Linear Time
inferredcites →https://doi.org/10.1137/1.9780898719796openalex-snapshot
Graph Classes: A Survey
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferredcites →https://doi.org/10.5555/365411.365513openalex-snapshot
A polynomial time recognition algorithm for probe interval graphs
inferredcites →https://doi.org/10.5555/545381.545494openalex-snapshot
Construction of probe interval models

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11750321_47openalex-snapshot
On Probe Permutation Graphs
inferred← citeshttps://doi.org/10.1007/11775096_25openalex-snapshot
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_32openalex-snapshot
On the Probe Problem for $$(r,\ell )$$-Well-Coveredness
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_9openalex-snapshot
Finding d-Cuts in Probe H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_46openalex-snapshot
Probe Ptolemaic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_22openalex-snapshot
Characterisations and Linear-Time Recognition of Probe Cographs
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_45openalex-snapshot
An FPT Certifying Algorithm for the Vertex-Deletion Problem
inferred← citeshttps://doi.org/10.1007/s10479-009-0584-6openalex-snapshot
A characterization of chain probe graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.017openalex-snapshot
On probe permutation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.018openalex-snapshot
Adjacency matrices of probe interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.010openalex-snapshot
On the forbidden induced subgraph sandwich problem
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.005openalex-snapshot
On the forbidden induced subgraph probe and sandwich problems
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.006openalex-snapshot
The (k,ℓ) partitioned probe problem: NP-complete versus polynomial dichotomy
inferred← citeshttps://doi.org/10.1016/j.endm.2013.10.007openalex-snapshot
The generalized split probe problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.12.003openalex-snapshot
On the bi-enhancement of chordal-bipartite probe graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.11.004openalex-snapshot
The ( k , ℓ ) unpartitioned probe problem NP-complete versus polynomial dichotomy
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.038openalex-snapshot
Partitioned probe comparability graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.029openalex-snapshot
Probe threshold and probe trivially perfect graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115088openalex-snapshot
Computing subset vertex covers in H-free graphs
inferred← citeshttps://doi.org/10.21711/231766362012/rmc4214openalex-snapshot
Searching for a NP-Complete Probe Graph Problem
inferred← citeshttps://doi.org/10.46298/dmtcs.401openalex-snapshot
Probe split graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0811.2675openalex-snapshot
Characterizations of probe interval graphs
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.