On the public citation graph
Perfect couples 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/bf02122693openalex-snapshot
Entropy splitting for antiblocking corners and perfect graphs
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0095-8956(86)90087-0openalex-snapshot
Relaxations of vertex packing
inferredcites →https://doi.org/10.1016/s0195-6698(88)80048-9openalex-snapshot
New Bounds for Perfect Hashing via Information Theory
inferredcites →https://doi.org/10.1109/tit.1973.1055109openalex-snapshot
Two-step encoding for finite sources
inferredcites →https://doi.org/10.1137/0607062openalex-snapshot
Fredman–Komlós bounds and information theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9783527693245.ch4openalex-snapshot
Entropy, Counting, and Fractional Chromatic Number
inferred← citeshttps://doi.org/10.1002/jgt.20001openalex-snapshot
Edge colorings of complete graphs without tricolored triangles
inferred← citeshttps://doi.org/10.1002/jgt.20252openalex-snapshot
Cross‐intersecting couples of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20452openalex-snapshot
Ramsey‐type results for Gallai colorings
inferred← citeshttps://doi.org/10.1002/jgt.20646openalex-snapshot
Gallai colorings and domination in multipartite digraphs
inferred← citeshttps://doi.org/10.1002/jgt.21694openalex-snapshot
Disconnected Colors in Generalized Gallai-Colorings
inferred← citeshttps://doi.org/10.1007/978-3-319-94830-0_2openalex-snapshot
On Graphs Whose Maximal Cliques and Stable Sets Intersect
inferred← citeshttps://doi.org/10.1007/s00493-017-3559-2openalex-snapshot
Minimal Normal Graph Covers
inferred← citeshttps://doi.org/10.1007/s00493-020-4324-5openalex-snapshot
Probabilistic Refinement of the Asymptotic Spectrum of Graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2022.102377openalex-snapshot
Complete edge-colored permutation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.021openalex-snapshot
Constructions for normal graphs and some consequences
inferred← citeshttps://doi.org/10.1016/j.dam.2009.06.026openalex-snapshot
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.014openalex-snapshot
On exact blockers and anti-blockers, Δ -conjecture, and related problems
inferred← citeshttps://doi.org/10.1016/j.disc.2009.10.013openalex-snapshot
Gallai colorings of non-complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.020openalex-snapshot
Entropy of symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.05.015openalex-snapshot
Counting Gallai 3-colorings of complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112567openalex-snapshot
Extremal problems and results related to Gallai-colorings
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104225openalex-snapshot
Transitive and Gallai colorings of the complete graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.12.004openalex-snapshot
The number of Gallai k-colorings of complete graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80185-4openalex-snapshot
Perfection, Imperfection, and Graph Entropy
inferred← citeshttps://doi.org/10.1109/isit.2004.1365370openalex-snapshot
Lossy source coding under a maximum distortion constraint with decoder side-information
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240301openalex-snapshot
Uniquely-Decodable Coding for Network Function Computation
inferred← citeshttps://doi.org/10.1109/tit.2014.2303802openalex-snapshot
Distributed Computing and the Graph Entropy Region
inferred← citeshttps://doi.org/10.1155/2020/3562382openalex-snapshot
Some Bounds of Weighted Entropies with Augmented Zagreb Index Edge Weights
inferred← citeshttps://doi.org/10.1215/00192082-9799163openalex-snapshot
Information theoretic parameters of noncommutative graphs and convex corners
inferred← citeshttps://doi.org/10.37236/10571openalex-snapshot
Colored Unavoidable Patterns and Balanceable Graphs
inferred← citeshttps://doi.org/10.37236/5642openalex-snapshot
Symmetric Graphs with Respect to Graph Entropy
inferred← citeshttps://doi.org/10.3990/1.9789036552486openalex-snapshot
Gallai-Ramsey numbers for graphs and their generalizations
inferred← citeshttps://doi.org/10.3990/1.9789036556675openalex-snapshot
Graph entropy and related topics
inferred← citeshttps://doi.org/10.48550/arxiv.1805.06805openalex-snapshot
Counting Gallai 3-colorings of complete graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1812.10465openalex-snapshot
The number of Gallai k-colorings of complete 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.