Transversals of Vertex Partitions in Graphs
From MaRDI portal
Publication:4712708
DOI10.1137/0403018zbMath0735.05057DBLPjournals/siamdm/Fellows90OpenAlexW2069550402WikidataQ56390835 ScholiaQ56390835MaRDI QIDQ4712708
Publication date: 25 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403018
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (17)
A revival of the girth conjecture ⋮ The strong chromatic number of a graph ⋮ The circular chromatic index of graphs of high girth ⋮ Colorings, transversals, and local sparsity ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ Graphs of low average degree without independent transversals ⋮ On upper bounds for the independent transversal domination number ⋮ Packing list‐colorings ⋮ Fractional total colourings of graphs of high girth ⋮ Independent systems of representatives in weighted graphs ⋮ On the independence transversal total domination number of graphs ⋮ A solution to a colouring problem of P. Erdős ⋮ Systems of distant representatives ⋮ Entropy compression versus Lovász local lemma ⋮ An asymptotic bound for the strong chromatic number ⋮ Finding independent transversals efficiently ⋮ A note on coloring vertex-transitive graphs
This page was built for publication: Transversals of Vertex Partitions in Graphs
