On the public citation graph
Decomposition of graphs
0 signed · 47 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/bf01069217openalex-snapshot
Graphs and degree sequences: Canonical decomposition
inferredcites →https://doi.org/10.1007/bfb0070380openalex-snapshot
Graphs and their degree sequences: A survey
inferredcites →https://doi.org/10.1016/0095-8956(80)90069-6openalex-snapshot
A note on Hamiltonian split 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/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70492-8openalex-snapshot
Linear Separation of Dominating Sets in Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70731-3openalex-snapshot
Aggregation of Inequalities in Integer Programming
inferredcites →https://doi.org/10.1016/s0167-5060(08)70749-0openalex-snapshot
The Minimal Integral Separator of A Threshold Graph
inferredcites →https://doi.org/10.1137/0206008openalex-snapshot
A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
inferredcites →https://doi.org/10.4153/cjm-1977-069-1openalex-snapshot
Split Graphs Having Dilworth Number Two
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.10049openalex-snapshot
A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50
inferred← citeshttps://doi.org/10.1002/jgt.21755openalex-snapshot
On the Polarity and Monopolarity of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22182openalex-snapshot
Dominating induced matchings in graphs containing no long claw
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_23openalex-snapshot
Polar Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_14openalex-snapshot
Recognizing Polar Planar Graphs Using New Results for Monopolarity
inferred← citeshttps://doi.org/10.1007/s00373-012-1270-zopenalex-snapshot
Solving Partition Problems with Colour-Bipartitions
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90113-5openalex-snapshot
About recognizing (α, β) classes of polar
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90184-1openalex-snapshot
On forcibly hereditary p-graphical sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2013.08.011openalex-snapshot
Algorithms for unipolar and generalized split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.012openalex-snapshot
On the dominating induced matching problem: Spectral results and sharp bounds
inferred← citeshttps://doi.org/10.1016/j.dam.2016.08.001openalex-snapshot
Decomposing highly connected graphs into paths of length five
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.023openalex-snapshot
Monopolar graphs: Complexity of computing classical graph parameters
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.050openalex-snapshot
Locating eigenvalues of matrogenic graphs in linear time
inferred← citeshttps://doi.org/10.1016/j.disc.2005.10.026openalex-snapshot
Bipartite bihypergraphs: A survey and new results
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.007openalex-snapshot
Operator decomposition of graphs and the reconstruction conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112826openalex-snapshot
The Hamiltonian properties in K1,r-free split graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.12.007openalex-snapshot
Polar permutation graphs are polynomial-time recognisable
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.12.004openalex-snapshot
Forbidden graphs for classes of split-like graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.035openalex-snapshot
Bipartite operator decomposition of graphs and the reconstruction conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.107openalex-snapshot
Decompositions of highly connected graphs into paths of any given length
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.08.002openalex-snapshot
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.05.005openalex-snapshot
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.07.010openalex-snapshot
Decomposing highly edge-connected graphs into paths of any given length
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.336openalex-snapshot
Maya-Tupi graphs: a generalization of split graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.038openalex-snapshot
Satgraphs and independent domination. Part 1
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.049openalex-snapshot
Independent domination in hereditary classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.032openalex-snapshot
Complexity and algorithms for recognizing polar and monopolar graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00318-1openalex-snapshot
r-Bounded k-complete bipartite bihypergraphs and generalized split graphs
inferred← citeshttps://doi.org/10.1051/ro/2023149openalex-snapshot
On two variants of split graphs: 2-unipolar graph and k-probe-split graph
inferred← citeshttps://doi.org/10.1515/ausi-2015-0013openalex-snapshot
Tripartite graphs with given degree set
inferred← citeshttps://doi.org/10.26021/2029openalex-snapshot
Aggregation and other patterns of graphs in space.
inferred← citeshttps://doi.org/10.48550/arxiv.1604.00905openalex-snapshot
Polarity and Monopolarity of $3$-colourable comparability 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.