On the public citation graph
On the total domatic number of regular graphs
0 signed · 20 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/bf01787474openalex-snapshot
Transversal numbers of uniform hypergraphs
inferredcites →https://doi.org/10.1016/0097-3165(78)90059-6openalex-snapshot
The asymptotic number of labeled graphs with given degree sequences
inferredcites →https://doi.org/10.1016/j.disc.2008.01.034openalex-snapshot
On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset
inferredcites →https://doi.org/10.1017/cbo9780511721335.010openalex-snapshot
Models of Random Regular Graphs
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-31110-0_2openalex-snapshot
Key Domination Parameters
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_25openalex-snapshot
On Coupon Coloring of Cartesian Product of Some Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_3openalex-snapshot
Parameterized Complexity of Coupon Coloring of Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.026openalex-snapshot
On coupon colorings of graphs
inferred← citeshttps://doi.org/10.1080/23799927.2020.1771427openalex-snapshot
The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings
inferred← citeshttps://doi.org/10.1155/2020/5473675openalex-snapshot
The Numerical Invariants concerning the Total Domination for Generalized Petersen Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1525.7f3openalex-snapshot
A characterization of graphs with disjoint total dominating sets
inferred← citeshttps://doi.org/10.26493/2590-9770.1507.dc5openalex-snapshot
Coupon coloring of lexicographic product of graphs
inferred← citeshttps://doi.org/10.3390/math10040640openalex-snapshot
The Domatic Partition Problem in Separable Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2015.954851openalex-snapshot
Um estudo sobre conjuntos cliques-dominantes em grafos
inferred← citeshttps://doi.org/10.48550/arxiv.1609.09684openalex-snapshot
Thoroughly Distributed Colorings
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10713openalex-snapshot
On Domatic and Total Domatic Numbers of Product 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.