Transversals of Vertex Partitions in Graphs

DOI10.1137/0403018MaRDI QIDQ4712708zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael R. Fellows

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

zbMATH Keywords

complexityfault-tolerant data storagetransversal

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Publication:4862104
• Finding independent transversals efficiently
• Bounded size components -- partitions and transversals.
• Extremal problems for transversals in graphs with bounded degree

Cited in

(25)

• A solution to a colouring problem of P. Erdős
• Independent transversals in \(r\)-partite graphs
• Bisection width of transposition graphs
• On upper bounds for the independent transversal domination number
• Systems of distant representatives
• A revival of the girth conjecture
• Entropy compression versus Lovász local lemma
• A note on coloring vertex-transitive graphs
• Independent systems of representatives in weighted graphs
• On subgraphs induced by transversals in vertex-partitions of graphs
• scientific article; zbMATH DE number 5833710 (Why is no real title available?)
• The strong chromatic number of a graph
• scientific article; zbMATH DE number 1146236 (Why is no real title available?)
• scientific article; zbMATH DE number 2058456 (Why is no real title available?)
• Finding independent transversals efficiently
• On the independence transversal total domination number of graphs
• An asymptotic bound for the strong chromatic number
• Colorings, transversals, and local sparsity
• Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
• Graphs of low average degree without independent transversals
• Packing list‐colorings
• Fractional total colourings of graphs of high girth
• Independent transversal domination number in complementary prisms
• A reduction of the ``cycles plus \(K_4\)'s problem
• The circular chromatic index of graphs of high girth

This page was built for publication: Transversals of Vertex Partitions in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712708)