On the public citation graph

Transversal numbers of uniform hypergraphs

0 signed · 158 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.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.4153/cmb-1971-007-1openalex-snapshot

A Constructive Solution to a Tournament Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119716600.ch10openalex-snapshot

Network Modelling Methods for Precision Medicine

inferred← citeshttps://doi.org/10.1002/jgt.20278openalex-snapshot

Pebbling and optimal pebbling in graphs

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.22021openalex-snapshot

Minimum Degree and Dominating Paths

inferred← citeshttps://doi.org/10.1002/jgt.22503openalex-snapshot

Distance domination and generalized eccentricity in graphs with given minimum degree

inferred← citeshttps://doi.org/10.1002/jgt.23051openalex-snapshot

Transversals in regular uniform hypergraphs

inferred← citeshttps://doi.org/10.1002/jgt.23070openalex-snapshot

Optimal linear‐Vizing relationships for (total) domination in graphs

inferred← citeshttps://doi.org/10.1006/jctb.1999.1905openalex-snapshot

Signed Domination in Regular Graphs and Set-Systems

inferred← citeshttps://doi.org/10.1007/3-540-44849-7_15openalex-snapshot

Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs

inferred← citeshttps://doi.org/10.1007/3-540-45655-4_24openalex-snapshot

On the Connected Domination Number of Random Regular Graphs

inferred← citeshttps://doi.org/10.1007/3-540-61680-2_71openalex-snapshot

On-line and off-line approximation algorithms for vector covering problems

inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_25openalex-snapshot

Equitable Coloring of Graphs

inferred← citeshttps://doi.org/10.1007/978-1-4614-6525-6_1openalex-snapshot

Introduction

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_25-1openalex-snapshot

Equitable Coloring of Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_10openalex-snapshot

Fractional Dominating 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-67318-5_25openalex-snapshot

Hypernetwork Science: From Multidimensional Networks to Computational Topology

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-319-92043-6_8openalex-snapshot

A Topological Approach to Representational Data Models

inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_20openalex-snapshot

A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves

inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_29openalex-snapshot

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

inferred← citeshttps://doi.org/10.1007/pl00009203openalex-snapshot

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

inferred← citeshttps://doi.org/10.1007/s00373-009-0864-6openalex-snapshot

Upper Bounds for α-Domination Parameters

inferred← citeshttps://doi.org/10.1007/s00373-010-0973-2openalex-snapshot

Spanning Trees: A Survey

inferred← citeshttps://doi.org/10.1007/s00373-010-0992-zopenalex-snapshot

On Roman, Global and Restrained Domination in Graphs

inferred← citeshttps://doi.org/10.1007/s00373-011-1040-3openalex-snapshot

k-Domination and k-Independence in Graphs: A Survey

inferred← citeshttps://doi.org/10.1007/s00373-014-1405-5openalex-snapshot

Sharp Concentration of Hitting Size for Random Set Systems

inferred← citeshttps://doi.org/10.1007/s00373-015-1585-7openalex-snapshot

Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five

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/s00453-014-9949-6openalex-snapshot

Algorithms and Almost Tight Results for $$3$$ 3 -Colorability of Small Diameter Graphs

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/s10958-011-0611-4openalex-snapshot

Constructing a spanning tree with many leaves

inferred← citeshttps://doi.org/10.1007/s10958-011-0613-2openalex-snapshot

Spanning trees with many leaves

inferred← citeshttps://doi.org/10.1007/s10958-012-0880-6openalex-snapshot

Bounds of the number of leaves of spanning trees in graphs without triangles

inferred← citeshttps://doi.org/10.1007/s10958-012-0881-5openalex-snapshot

Bounds of the number of leaves of spanning trees

inferred← citeshttps://doi.org/10.1007/s10958-014-1691-8openalex-snapshot

Spanning Trees with many Leaves: New Lower Bounds in Terms of the Number of Vertices of Degree 3 and at Least 4

inferred← citeshttps://doi.org/10.1007/s10958-014-1692-7openalex-snapshot

Spanning Trees With Many Leaves: Lower Bounds in Terms of the Number of Vertices of Degree 1, 3 and at Least 4

inferred← citeshttps://doi.org/10.1007/s10958-018-3857-2openalex-snapshot

Lower Bounds on the Number of Leaves in Spanning Trees

inferred← citeshttps://doi.org/10.1007/s10958-018-4132-2openalex-snapshot

A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6

inferred← citeshttps://doi.org/10.1007/s11856-023-2499-3openalex-snapshot

Spanning trees with few non-leaves

inferred← citeshttps://doi.org/10.1007/s12204-024-2699-yopenalex-snapshot

Hypergraph-Based Asynchronous Event Processing for Moving Object Classification

inferred← citeshttps://doi.org/10.1007/s13226-022-00265-2openalex-snapshot

Connected domination in random graphs

inferred← citeshttps://doi.org/10.1007/s13370-018-0605-1openalex-snapshot

Graphs with forbidden subgraphs and leaf number

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/s40305-025-00588-xopenalex-snapshot

Some Nordhaus–Gaddum-Type Results on Spectral Radius and Transversals of Uniform Hypergraphs

inferred← citeshttps://doi.org/10.1016/0012-365x(90)90354-kopenalex-snapshot

Covering all cliques of a graph

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.cor.2018.03.014openalex-snapshot

Multiple domination models for placement of electric vehicle charging stations in road networks

inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.009openalex-snapshot

Domination, radius, and minimum degree

inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.008openalex-snapshot

Minimum k -path vertex cover

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.2013.05.006openalex-snapshot

On upper bounds for multiple domination numbers of graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.026openalex-snapshot

On coupon colorings of graphs

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.05.039openalex-snapshot

Domination in intersecting hypergraphs

inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.014openalex-snapshot

Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs

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.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.dam.2026.02.054openalex-snapshot

Regular graphs with equal weakly connected domination number and matching number

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.2008.05.029openalex-snapshot

Connected domination of regular graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.014openalex-snapshot

Rainbow edge-coloring and rainbow domination

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.2015.05.003openalex-snapshot

On general frameworks and threshold functions for multiple domination

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.2022.113228openalex-snapshot

A note on connected domination number and leaf number

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.ejc.2011.08.002openalex-snapshot

Transversals and domination in uniform 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.jctb.2017.04.001openalex-snapshot

Tournaments, 4-uniform hypergraphs, and an exact extremal result

inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00055-4openalex-snapshot

2-connected graphs with small 2-connected dominating sets

inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00372-xopenalex-snapshot

Bounds for optimal coverings

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71043-4openalex-snapshot

Covering All Cliques of a Graph

inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00225-2openalex-snapshot

Bounds for Optimal Coverings

inferred← citeshttps://doi.org/10.1017/s0963548300004260openalex-snapshot

Dominating a Family of Graphs with Small Connected Subgraphs

inferred← citeshttps://doi.org/10.1017/s0963548324000452openalex-snapshot

On perfect subdivision tilings

inferred← citeshttps://doi.org/10.1038/srep01736openalex-snapshot

Minimum Dominating Sets in Scale-Free Network Ensembles

inferred← citeshttps://doi.org/10.1038/srep06308openalex-snapshot

Dominating Scale-Free Networks Using Generalized Probabilistic Methods

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.1063/1.4938885openalex-snapshot

State machine components selection based on minimal transversals

inferred← citeshttps://doi.org/10.1080/09720529.2020.1766761openalex-snapshot

Bounds on the leaf number in graphs of girth 4 or 5

inferred← citeshttps://doi.org/10.1090/pspum/110/02015openalex-snapshot

Neighborly spheres and transversal numbers

inferred← citeshttps://doi.org/10.1093/oso/9780198856740.003.0004openalex-snapshot

Graph Models for Backbone Sets and Limited Packings in Networks

inferred← citeshttps://doi.org/10.1093/oso/9780198856740.003.0005openalex-snapshot

Graph Models for Optimization Problems in Road Networks

inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942076openalex-snapshot

Resolving the Trilemma in Logic Encryption

inferred← citeshttps://doi.org/10.1109/tcbb.2018.2875692openalex-snapshot

Identification of Minimum Set of Master Regulatory Genes in Gene Regulatory Networks

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.1109/ton.2024.3524941openalex-snapshot

Generating Dominating Sets Using Locally Defined Centrality Measures

inferred← citeshttps://doi.org/10.1112/s0024611502013886openalex-snapshot

ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS

inferred← citeshttps://doi.org/10.1137/060664318openalex-snapshot

Spanning Trees with Many Leaves in Graphs With Minimum Degree Three

inferred← citeshttps://doi.org/10.1137/070710494openalex-snapshot

Spanning Directed Trees with Many Leaves

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/24m1682361openalex-snapshot

Transversal Numbers of Simplicial Polytopes, Spheres, and Pure Complexes

inferred← citeshttps://doi.org/10.1137/s089548010240276769openalex-snapshot

Equitable Coloring of k -Uniform Hypergraphs

inferred← citeshttps://doi.org/10.1137/s0895480199353780openalex-snapshot

Connected Domination and Spanning Trees with Many Leaves

inferred← citeshttps://doi.org/10.1140/epjds/s13688-020-00231-0openalex-snapshot

Hypernetwork science via high-order hypergraph walks

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.1145/195058.195122openalex-snapshot

On contention resolution protocols and associated probabilistic phenomena

inferred← citeshttps://doi.org/10.1145/274787.274816openalex-snapshot

On contention resolution protocols and associated probabilistic phenomena

inferred← citeshttps://doi.org/10.1145/3717823.3718184openalex-snapshot

Disjoint Connected Dominating Sets in Pseudorandom Graphs

inferred← citeshttps://doi.org/10.1201/b10613-26openalex-snapshot

References

inferred← citeshttps://doi.org/10.14279/depositonce-1750openalex-snapshot

Geometric and Combinatorial Structures on Graphs

inferred← citeshttps://doi.org/10.14445/22315373/ijmtt-v44p510openalex-snapshot

A Review on Rainbow Edge Colouring and Rainbow Domination

inferred← citeshttps://doi.org/10.20429/tag.2021.080106openalex-snapshot

Reducing the maximum degree of a graph: comparisons of bounds

inferred← citeshttps://doi.org/10.20868/upm.thesis.68759openalex-snapshot

Networks in Natural Computing and Precision Medicine

inferred← citeshttps://doi.org/10.22108/toc.2012.760openalex-snapshot

On the total domatic number of regular graphs

inferred← citeshttps://doi.org/10.22331/q-2019-09-02-181openalex-snapshot

Simulation of quantum circuits by low-rank stabilizer decompositions

inferred← citeshttps://doi.org/10.26493/1855-3974.1172.baeopenalex-snapshot

On domination-type invariants of Fibonacci cubes and hypercubes

inferred← citeshttps://doi.org/10.26493/1855-3974.2771.4dfopenalex-snapshot

Optimal strategies in fractional games: vertex cover and domination

inferred← citeshttps://doi.org/10.2989/16073606.2016.1260069openalex-snapshot

Matching criticality in intersecting hypergraphs

inferred← citeshttps://doi.org/10.2989/16073606.2017.1282892openalex-snapshot

Lower bounds on the leaf number in graphs with forbidden subgraphs

inferred← citeshttps://doi.org/10.2989/16073606.2022.2050958openalex-snapshot

Radius, leaf number, connected domination number and minimum degree

inferred← citeshttps://doi.org/10.3390/axioms13060364openalex-snapshot

Finding Set Extreme 3-Uniform Hypergraphs Cardinality through Second-Order Signatures

inferred← citeshttps://doi.org/10.3390/math13060910openalex-snapshot

Partial Total Domination in Hypergraphs

inferred← citeshttps://doi.org/10.35925/j.multi.2022.4.5openalex-snapshot

Dominating sets in random graphs

inferred← citeshttps://doi.org/10.37236/1161openalex-snapshot

A Survey on Packing and Covering Problems in the Hamming Permutation Space

inferred← citeshttps://doi.org/10.37236/2576openalex-snapshot

Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number

inferred← citeshttps://doi.org/10.37236/3866openalex-snapshot

Total Transversals and Total Domination in Uniform Hypergraphs

inferred← citeshttps://doi.org/10.37236/4562openalex-snapshot

Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5

inferred← citeshttps://doi.org/10.37236/8730openalex-snapshot

Fractional Domination Game

inferred← citeshttps://doi.org/10.37236/9519openalex-snapshot

Minimal Non-Odd-Transversal Hypergraphs and Minimal Non-Odd-Bipartite Hypergraphs

inferred← citeshttps://doi.org/10.3990/1.978-9036523707openalex-snapshot

Sparse cuts, matching-cuts and leafy trees in graphs

inferred← citeshttps://doi.org/10.3990/1.9789036523707openalex-snapshot

Sparse cuts, matching-cuts and leafy trees in graphs

inferred← citeshttps://doi.org/10.47443/ejm.2023.027openalex-snapshot

Connected domination number and traceable graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1201.5097openalex-snapshot

Sharp Concentration of Hitting Size for Random Set Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1202.4665openalex-snapshot

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1401.6206openalex-snapshot

Upper bounds on the k-forcing number of a graph

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.1612.03435openalex-snapshot

Depth with respect to a family of convex sets

inferred← citeshttps://doi.org/10.48550/arxiv.2007.08930openalex-snapshot

Reducing the maximum degree of a graph: comparisons of bounds

inferred← citeshttps://doi.org/10.48550/arxiv.2104.09206openalex-snapshot

Network modeling methods for precision medicine

inferred← citeshttps://doi.org/10.48550/arxiv.2105.03890openalex-snapshot

Optimal strategies in fractional games: vertex cover and domination

inferred← citeshttps://doi.org/10.48550/arxiv.math/0111257openalex-snapshot

The domatic number of regular and almost regular graphs

inferred← citeshttps://doi.org/10.48550/arxiv.math/0202230openalex-snapshot

Equitable coloring of k-uniform hypergraphs

inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-098openalex-snapshot

On Perfect Subdivision Tilings

inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot

Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.

inferred← citeshttps://doi.org/10.7151/dmgt.2339openalex-snapshot

Domination number of graphs with minimum degree five

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.