On the public citation graph
Vertex Partitions under Size-Adaptive Degree Constraints
0 signed · 22 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.1002/(sici)1097-0118(199611)23:3<321::aid-jgt12>3.0.co;2-hopenalex-snapshot
Decomposing graphs under degree constraints
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199703)24:3<205::aid-jgt2>3.0.co;2-topenalex-snapshot
Defective coloring revisited
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199801)27:1<7::aid-jgt2>3.0.co;2-uopenalex-snapshot
On decomposition of triangle-free graphs under degree constraints
inferredcites →https://doi.org/10.1002/(sici)1097-0118(200004)33:4<237::aid-jgt4>3.0.co;2-aopenalex-snapshot
Decomposing graphs with girth at least five under degree constraints
inferredcites →https://doi.org/10.1002/jgt.22364openalex-snapshot
Decomposing C 4 ‐free graphs under degree constraints
inferredcites →https://doi.org/10.1002/jgt.3190070204openalex-snapshot
Graph decomposition with constraints on the connectivity and minimum degree
inferredcites →https://doi.org/10.1002/jgt.3190100207openalex-snapshot
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
inferredcites →https://doi.org/10.1002/net.21791openalex-snapshot
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
inferredcites →https://doi.org/10.1002/rsa.21238openalex-snapshot
Partitioning graphs with linear minimum degree
inferredcites →https://doi.org/10.1007/s004939970002openalex-snapshot
Exact Bounds for Judicious Partitions of Graphs
inferredcites →https://doi.org/10.1016/j.dam.2006.10.005openalex-snapshot
Efficient algorithms for decomposing graphs under degree constraints
inferredcites →https://doi.org/10.1016/j.dam.2012.07.019openalex-snapshot
On the maximum quasi-clique problem
inferredcites →https://doi.org/10.1016/j.dam.2017.04.007openalex-snapshot
On partitions of graphs under degree constraints
inferredcites →https://doi.org/10.1016/j.dam.2018.10.016openalex-snapshot
Partitions of multigraphs under minimum degree constraints
inferredcites →https://doi.org/10.1016/j.dam.2019.10.027openalex-snapshot
Partitions of graphs and multigraphs under degree constraints
inferredcites →https://doi.org/10.1016/j.dam.2020.02.003openalex-snapshot
LP-based dual bounds for the maximum quasi-clique problem
inferredcites →https://doi.org/10.1016/j.dam.2020.03.014openalex-snapshot
A note on partitions of graphs under degree constraints
inferredcites →https://doi.org/10.1016/j.ejor.2012.10.021openalex-snapshot
On clique relaxation models in network analysis
inferredcites →https://doi.org/10.1016/j.ins.2022.08.073openalex-snapshot
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
inferredcites →https://doi.org/10.1017/cbo9780511734885.006openalex-snapshot
Judicious partitions and related problems
inferredcites →https://doi.org/10.1111/itor.12637openalex-snapshot
An exact algorithm for the maximum quasi‐clique problem
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.