On the public citation graph
Transversals of Vertex Partitions in Graphs
0 signed · 52 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.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
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-0118(199601)21:1<21::aid-jgt3>3.0.co;2-oopenalex-snapshot
Vertex transversals that dominate
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.10079openalex-snapshot
3‐colorability of 4‐regular hamiltonian graphs
inferred← citeshttps://doi.org/10.1002/jgt.20300openalex-snapshot
An improved bound for the strong chromatic number
inferred← citeshttps://doi.org/10.1002/jgt.22800openalex-snapshot
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
inferred← citeshttps://doi.org/10.1002/jgt.22876openalex-snapshot
Graphs of low average degree without independent transversals
inferred← citeshttps://doi.org/10.1002/rsa.21051openalex-snapshot
Colorings, transversals, and local sparsity
inferred← citeshttps://doi.org/10.1002/rsa.3240030102openalex-snapshot
The strong chromatic number of a graph
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_9openalex-snapshot
Some Remarks on the Cycle Plus Triangles Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_3openalex-snapshot
De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_9openalex-snapshot
Independent transversals and hypergraph matchings - an elementary approach
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8openalex-snapshot
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_13openalex-snapshot
Some Remarks on the Cycle Plus Triangles Problem
inferred← citeshttps://doi.org/10.1007/s00493-007-2086-yopenalex-snapshot
Independent systems of representatives in weighted graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90588-7openalex-snapshot
A solution to a colouring problem of P. Erdős
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102163openalex-snapshot
Entropy compression versus Lovász Local Lemma
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.018openalex-snapshot
Systems of distant representatives
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.033openalex-snapshot
On the independence transversal total domination number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.09.011openalex-snapshot
On upper bounds for the independent transversal domination number
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114696openalex-snapshot
A reduction of the “cycles plus K4's” problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.04.003openalex-snapshot
A revival of the girth conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.03.002openalex-snapshot
The circular chromatic index of graphs of high girth
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.12.005openalex-snapshot
Fractional total colourings of graphs of high girth
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferred← citeshttps://doi.org/10.1017/s0963548304006157openalex-snapshot
On the Strong Chromatic Number
inferred← citeshttps://doi.org/10.1017/s0963548307008607openalex-snapshot
On the Strong Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548318000561openalex-snapshot
An asymptotic bound for the strong chromatic number
inferred← citeshttps://doi.org/10.1017/s0963548320000127openalex-snapshot
Finding independent transversals efficiently
inferred← citeshttps://doi.org/10.1137/050633056openalex-snapshot
On the Strong Chromatic Number of Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.41openalex-snapshot
Algorithms for weighted independent transversals and strong colouring
inferred← citeshttps://doi.org/10.1145/3474057openalex-snapshot
Algorithms for Weighted Independent Transversals and Strong Colouring
inferred← citeshttps://doi.org/10.1145/3711896.3736950openalex-snapshot
Fair Diversity Maximization with Few Representatives
inferred← citeshttps://doi.org/10.11650/tjm.1187openalex-snapshot
AN EXTENSION OF DHH-ERD ¨ OS CONJECTURE ON CYCLE-PLUS-TRIANGLE GRAPHS
inferred← citeshttps://doi.org/10.11650/twjm/1500407434openalex-snapshot
AN EXTENSION OF DHH-ERD ¨ OS CONJECTURE ON CYCLE-PLUS-TRIANGLE GRAPHS
inferred← citeshttps://doi.org/10.22214/ijraset.2019.4278openalex-snapshot
Graph coloring Parameters-A Survey
inferred← citeshttps://doi.org/10.2298/fil1602293aopenalex-snapshot
Independent transversal dominating sets in graphs: Complexity and structural properties
inferred← citeshttps://doi.org/10.2991/978-94-6463-228-6_38openalex-snapshot
The Transversal Neighborhood Domination Number on Parachute Graph and Semi-Parachute Graph
inferred← citeshttps://doi.org/10.3390/axioms15040278openalex-snapshot
Complement Reducible Uniform Hypergraphs
inferred← citeshttps://doi.org/10.37236/4626openalex-snapshot
A Note on Coloring Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.118.09.777openalex-snapshot
On Forming Committees
inferred← citeshttps://doi.org/10.48550/arxiv.0911.2808openalex-snapshot
Fractional total colourings of graphs of high girth
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6550openalex-snapshot
A note on coloring vertex-transitive graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1509.04638openalex-snapshot
A local lemma via entropy compression
inferred← citeshttps://doi.org/10.48550/arxiv.1612.02663openalex-snapshot
A constructive algorithm for the LLL on permutations
inferred← citeshttps://doi.org/10.48550/arxiv.2003.05233openalex-snapshot
Colourings, transversals and local sparsity
inferred← citeshttps://doi.org/10.53570/jnt.1720611openalex-snapshot
Transversal Semitotal Domination Number in 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.