On the public citation graph
The Domatic Number Problem in Interval Graphs
0 signed · 35 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/net.3230070305openalex-snapshot
Towards a theory of domination in graphs
inferredcites →https://doi.org/10.1007/bfb0070371openalex-snapshot
Domination of undirected graphs — A survey
inferredcites →https://doi.org/10.1007/bfb0092276openalex-snapshot
On domination related concepts in Graph Theory
inferredcites →https://doi.org/10.1016/0020-0190(88)90173-1openalex-snapshot
On the domatic number of internal graphs
inferredcites →https://doi.org/10.1016/0166-218x(85)90025-3openalex-snapshot
Dominating sets and domatic number of circular arc graphs
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1109/tcs.1975.1083994openalex-snapshot
Optimal domination in graphs
inferredcites →https://doi.org/10.1137/1.9781611970401openalex-snapshot
Graph Theory and Its Applications to Problems of Society
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199908)34:1<1::aid-net1>3.0.co;2-copenalex-snapshot
Deferred-query: An efficient approach for some problems on interval graphs
inferred← citeshttps://doi.org/10.1007/11602613_57openalex-snapshot
A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_250openalex-snapshot
Deferred-query—An efficient approach for problems on interval and circular-arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_282openalex-snapshot
Weighted independent perfect domination on cocomparability graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_26openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_28openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_1openalex-snapshot
Vertex Domination in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_22openalex-snapshot
Domatic Partition on Several Classes of Graphs
inferred← citeshttps://doi.org/10.1007/bf02986672openalex-snapshot
Edge domatic numbers of complete n- partite graphs
inferred← citeshttps://doi.org/10.1007/bfb0015448openalex-snapshot
A resource assignment problem on graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90151-1openalex-snapshot
The domatic number problem
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90115-copenalex-snapshot
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90249-uopenalex-snapshot
An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00067-3openalex-snapshot
Weighted independent perfect domination on cocomparability graphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.09.003openalex-snapshot
The upper domatic number of a graph
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.06.008openalex-snapshot
Domatically perfect graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.007openalex-snapshot
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
inferred← citeshttps://doi.org/10.1137/0409015openalex-snapshot
Finding a Domatic Partition of an Interval Graph in Time $O(n)$
inferred← citeshttps://doi.org/10.1137/s0895480196311328openalex-snapshot
A Study on r -Configurations---A Resource Assignment Problem on Graphs
inferred← citeshttps://doi.org/10.1142/s1793557122501571openalex-snapshot
Domatically full Cartesian product graphs
inferred← citeshttps://doi.org/10.3390/math10040640openalex-snapshot
The Domatic Partition Problem in Separable Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1106.5589openalex-snapshot
The k-Tuple Domatic Number of a Graph
inferred← citeshttps://doi.org/10.71889/5fylantbak.29862092openalex-snapshot
A Study Of The Upper Domatic Number Of A Graph
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.