On the public citation graph

Total Transversals and Total Domination in Uniform Hypergraphs

https://doi.org/10.37236/3866
0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.10136openalex-snapshot
How many disjoint 2‐edge paths must a cubic graph have?
inferredcites →https://doi.org/10.1002/jgt.20345openalex-snapshot
Total domination in 2‐connected graphs and in graphs with no induced 6‐cycles
inferredcites →https://doi.org/10.1002/net.3230100304openalex-snapshot
Total domination in graphs
inferredcites →https://doi.org/10.1007/978-1-4614-6525-6openalex-snapshot
Total Domination in Graphs
inferredcites →https://doi.org/10.1007/bf01191201openalex-snapshot
Small transversals in hypergraphs
inferredcites →https://doi.org/10.1007/bf01787474openalex-snapshot
Transversal numbers of uniform hypergraphs
inferredcites →https://doi.org/10.1007/s00493-007-2020-3openalex-snapshot
Total domination of graphs and small transversals of hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90354-kopenalex-snapshot
Covering all cliques of a graph
inferredcites →https://doi.org/10.1016/0095-8956(90)90101-5openalex-snapshot
An upper bound for the transversal numbers of 4-uniform hypergraphs
inferredcites →https://doi.org/10.1016/j.ejc.2011.08.002openalex-snapshot
Transversals and domination in uniform hypergraphs
inferredcites →https://doi.org/10.1016/j.ejc.2012.07.001openalex-snapshot
Transversals and matchings in 3-uniform hypergraphs
inferredcites →https://doi.org/10.1016/j.ejc.2013.07.016openalex-snapshot
Linear hypergraphs with large transversal number and maximum degree two
inferredcites →https://doi.org/10.1080/09728600.2007.12088825openalex-snapshot
Domination in Hypergraphs
inferredcites →https://doi.org/10.1137/090777001openalex-snapshot
Strong Transversals in Hypergraphs and Double Total Domination in Graphs
inferredcites →https://doi.org/10.1201/9781315141428openalex-snapshot
Domination in graphs : advanced topics
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.2298/aadm0902347jopenalex-snapshot
Hypergraph domination and strong independence
inferredcites →https://doi.org/10.2478/s11533-012-0023-9openalex-snapshot
Hypergraphs with large transversal number and with edge sizes at least four

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22204openalex-snapshot
Thoroughly dispersed colorings
inferred← citeshttps://doi.org/10.1007/978-3-030-58892-2_11openalex-snapshot
Domination and Total Domination in Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-021-02285-xopenalex-snapshot
Affine Planes and Transversals in 3-Uniform Linear Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10878-019-00456-4openalex-snapshot
Bounds on upper transversals in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.013openalex-snapshot
Domination game on uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.004openalex-snapshot
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.007openalex-snapshot
The minimum number of vertices in uniform hypergraphs with given domination number
inferred← citeshttps://doi.org/10.1016/j.disc.2017.05.001openalex-snapshot
A note on fractional disjoint transversals in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.002openalex-snapshot
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.07.003openalex-snapshot
Bounds on the game transversal number in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.01.002openalex-snapshot
Upper transversals in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105408openalex-snapshot
Domination numbers and noncover complexes of hypergraphs
inferred← citeshttps://doi.org/10.1137/140951722openalex-snapshot
Total Transversals in Hypergraphs and Their Applications
inferred← citeshttps://doi.org/10.3390/math13060910openalex-snapshot
Partial Total Domination in Hypergraphs
inferred← citeshttps://doi.org/10.37236/7267openalex-snapshot
On Upper Transversals in 3-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1601.04856openalex-snapshot
Bounds on the Game Transversal Number in Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1609.09684openalex-snapshot
Thoroughly Distributed Colorings
inferred← citeshttps://doi.org/10.48550/arxiv.1802.01825openalex-snapshot
Transversals in Uniform Linear Hypergraphs
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.