On the public citation graph
Small transversals in hypergraphs
0 signed · 122 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/sapm1949281148openalex-snapshot
A Theorem on Coloring the Lines of a Network
inferredcites →https://doi.org/10.1016/0097-3165(77)90001-2openalex-snapshot
Covering finite fields with cosets of subspaces
inferredcites →https://doi.org/10.1016/0097-3165(78)90013-4openalex-snapshot
The blocking number of an affine space
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.20240openalex-snapshot
Relationships between total domination, order, size, and maximum degree of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20340openalex-snapshot
Hypergraphs with large transversal number and with edge sizes at least 3
inferred← citeshttps://doi.org/10.1002/jgt.20345openalex-snapshot
Total domination in 2‐connected graphs and in graphs with no induced 6‐cycles
inferred← citeshttps://doi.org/10.1002/jgt.20443openalex-snapshot
Balloons, cut‐edges, matchings, and total domination in regular graphs of odd degree
inferred← citeshttps://doi.org/10.1002/jgt.20644openalex-snapshot
The potential of greed for independence
inferred← citeshttps://doi.org/10.1002/jgt.21993openalex-snapshot
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
inferred← citeshttps://doi.org/10.1002/jgt.22063openalex-snapshot
On Lower Bounds for the Matching Number of Subcubic Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22244openalex-snapshot
Tight lower bounds on the matching number in a graph with given maximum degree
inferred← citeshttps://doi.org/10.1002/jgt.23051openalex-snapshot
Transversals in regular uniform hypergraphs
inferred← citeshttps://doi.org/10.1006/jctb.2001.2037openalex-snapshot
Covering Non-uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_81openalex-snapshot
Variations of Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_12openalex-snapshot
Total Domination and Graph Products
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_13openalex-snapshot
Graphs with Disjoint Total Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_14openalex-snapshot
Total Domination in Graphs with Diameter Two
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_15openalex-snapshot
Nordhaus–Gaddum Bounds for Total Domination
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_17openalex-snapshot
Variations of Total Domination
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_2openalex-snapshot
Properties of Total Dominating Sets and General Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_3openalex-snapshot
Complexity and Algorithmic Results
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_4openalex-snapshot
Total Domination in Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_5openalex-snapshot
Total Domination and Minimum Degree
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_6openalex-snapshot
Total Domination in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_7openalex-snapshot
Total Domination and Forbidden Cycles
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_81-1openalex-snapshot
Variations of Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_12openalex-snapshot
Simple and Local Independent Set Approximation
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-58892-2_11openalex-snapshot
Domination and Total Domination in Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-69087-8_5openalex-snapshot
Related Games on Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-16081-3_32openalex-snapshot
On the Transversal Number of k-Uniform Connected Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20796-9_12openalex-snapshot
On the Transversal Number of Rank k Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_15openalex-snapshot
My Favorite Domination Conjectures in Graph Theory Are Bounded
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_12openalex-snapshot
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1007/bf02523693openalex-snapshot
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
inferred← citeshttps://doi.org/10.1007/s00373-008-0797-5openalex-snapshot
Total Domination in Graphs with Given Girth
inferred← citeshttps://doi.org/10.1007/s00373-008-0839-zopenalex-snapshot
Total Domination in Partitioned Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1059-5openalex-snapshot
An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s00373-013-1311-2openalex-snapshot
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1865-5openalex-snapshot
Total Domination Versus Domination in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1921-9openalex-snapshot
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four
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/s00493-007-2020-3openalex-snapshot
Total domination of graphs and small transversals of hypergraphs
inferred← citeshttps://doi.org/10.1007/s10878-019-00456-4openalex-snapshot
Bounds on upper transversals in hypergraphs
inferred← citeshttps://doi.org/10.1007/s10878-019-00481-3openalex-snapshot
Domination and matching in power and generalized power hypergraphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00968-6openalex-snapshot
A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
inferred← citeshttps://doi.org/10.1007/s40305-022-00445-1openalex-snapshot
An Upper Bound for the Transversal Number of Connected k-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s40590-021-00374-8openalex-snapshot
On transversal numbers of intersecting straight line systems and intersecting segment systems
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.014openalex-snapshot
On transversal and 2-packing numbers in uniform linear systems
inferred← citeshttps://doi.org/10.1016/j.amc.2019.02.060openalex-snapshot
Total forcing versus total domination in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2011.01.011openalex-snapshot
Nordhaus–Gaddum bounds for total domination
inferred← citeshttps://doi.org/10.1016/j.dam.2010.01.009openalex-snapshot
k -tuple total domination in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.021openalex-snapshot
On α -total domination in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.027openalex-snapshot
Directed domination in oriented graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.023openalex-snapshot
Hypergraphs with large domination number and with edge sizes at least three
inferred← citeshttps://doi.org/10.1016/j.dam.2012.09.006openalex-snapshot
Relating the annihilation number and the total domination number of a tree
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.017openalex-snapshot
Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2013.12.011openalex-snapshot
New potential functions for greedy independence and coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.019openalex-snapshot
Extremal hypergraphs for matching number and domination number
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.008openalex-snapshot
Essential upper bounds on the total domination number
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.039openalex-snapshot
Domination in intersecting hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.033openalex-snapshot
A new upper bound on the total domination number in graphs with minimum degree six
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.2006.04.017openalex-snapshot
Simultaneous graph parameters: Factor domination and factor total domination
inferred← citeshttps://doi.org/10.1016/j.disc.2006.10.024openalex-snapshot
On matching and total domination in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.044openalex-snapshot
A survey of selected recent results on total domination in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.006openalex-snapshot
On a conjecture on total domination in claw-free cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.08.006openalex-snapshot
Total domination stable graphs upon edge addition
inferred← citeshttps://doi.org/10.1016/j.disc.2012.06.024openalex-snapshot
Locating-total domination in claw-free cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.01.012openalex-snapshot
Hypergraphs with large transversal number
inferred← citeshttps://doi.org/10.1016/j.disc.2013.08.022openalex-snapshot
Minimum size transversals in uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.014openalex-snapshot
A characterization of hypergraphs that achieve equality in the Chvátal–McDiarmid Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.021openalex-snapshot
On matching and semitotal domination in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.10.012openalex-snapshot
Cops and Robbers on diameter two graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.034openalex-snapshot
Independence in 5-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.017openalex-snapshot
Total dominating sequences in graphs
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.2021.112546openalex-snapshot
On (1,2)-domination in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113756openalex-snapshot
A note on the Tuza constant c for small k
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114267openalex-snapshot
Transversal coalitions in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.08.002openalex-snapshot
Transversals and domination in uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.07.016openalex-snapshot
Linear hypergraphs with large transversal number and maximum degree two
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.ejc.2025.104201openalex-snapshot
Extensions and applications of the Tuza-Vestergaard theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.018openalex-snapshot
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00205-6openalex-snapshot
A note on greedy algorithms for the maximum weighted independent set problem
inferred← citeshttps://doi.org/10.1051/ro/2026085openalex-snapshot
A note on Tuza constant for the transversal number of intersecting uniform linear systems
inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942076openalex-snapshot
Resolving the Trilemma in Logic Encryption
inferred← citeshttps://doi.org/10.1109/tifs.2018.2850319openalex-snapshot
On the Approximation Resiliency of Logic Locking and IC Camouflaging Schemes
inferred← citeshttps://doi.org/10.1137/090777001openalex-snapshot
Strong Transversals in Hypergraphs and Double Total Domination in Graphs
inferred← citeshttps://doi.org/10.1137/140951722openalex-snapshot
Total Transversals in Hypergraphs and Their Applications
inferred← citeshttps://doi.org/10.1137/15m1049361openalex-snapshot
Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
inferred← citeshttps://doi.org/10.1137/24m1682361openalex-snapshot
Transversal Numbers of Simplicial Polytopes, Spheres, and Pure Complexes
inferred← citeshttps://doi.org/10.1142/s1793830919500046openalex-snapshot
A note on improved upper bounds on the transversal number of hypergraphs
inferred← citeshttps://doi.org/10.2478/s11533-011-0014-2openalex-snapshot
Dominating and total dominating partitions in cubic graphs
inferred← citeshttps://doi.org/10.2478/s11533-012-0023-9openalex-snapshot
Hypergraphs with large transversal number and with edge sizes at least four
inferred← citeshttps://doi.org/10.26493/1855-3974.1378.11dopenalex-snapshot
Relating the total domination number and the annihilation number of cactus graphs and block graphs
inferred← citeshttps://doi.org/10.2989/16073600709486210openalex-snapshot
A Transition from Total Domination in Graphs to Transversals in Hypergraphs
inferred← citeshttps://doi.org/10.2989/16073606.2014.981694openalex-snapshot
Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
inferred← citeshttps://doi.org/10.2989/16073606.2016.1260069openalex-snapshot
Matching criticality in intersecting hypergraphs
inferred← citeshttps://doi.org/10.37236/1085openalex-snapshot
Total Domination and Matching Numbers in Claw-Free Graphs
inferred← citeshttps://doi.org/10.37236/3601openalex-snapshot
A New Lower Bound on the Independence Number of a Graph and Applications
inferred← citeshttps://doi.org/10.37236/3866openalex-snapshot
Total Transversals and Total Domination in Uniform Hypergraphs
inferred← citeshttps://doi.org/10.37236/983openalex-snapshot
A New Upper Bound on the Total Domination Number of a Graph
inferred← citeshttps://doi.org/10.46298/dmtcs.2104openalex-snapshot
Graphs with large disjunctive total domination number
inferred← citeshttps://doi.org/10.48550/arxiv.1312.7555openalex-snapshot
Cops and Robbers on diameter two graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1681openalex-snapshot
Graphs with Large Disjunctive Total Domination Number
inferred← citeshttps://doi.org/10.48550/arxiv.1501.04679openalex-snapshot
Matchings and Path Covers with applications to Domination in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1511.07024openalex-snapshot
Pattern Recognition on Oriented Matroids: Symmetric Cycles in the Hypercube Graphs
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.2007.11997openalex-snapshot
Total Domination in Unit Disk Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1616openalex-snapshot
On the total k-domination number of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1854openalex-snapshot
Bounds on the disjunctive total domination number of a tree
inferred← citeshttps://doi.org/10.7151/dmgt.1865openalex-snapshot
A characterization of hypergraphs with large domination number
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.