Gallai theorems for graphs, hypergraphs, and set systems

DOI10.1016/0012-365X(88)90192-6zbMATH Open0728.05050OpenAlexW2010891937MaRDI QIDQ804601FDOQ804601

Authors E. J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90192-6

zbMATH Keywords

hereditary propertiessubgraphsedge covering numbervertex independence numberGallai Theoremspartition of verticesvertex covering number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Partitions of sets (05A18) Enumeration in graph theory (05C30) Hypergraphs (05C65) Transversal (matching) theory (05D15)

Recommendations

• scientific article; zbMATH DE number 890667
• A matroid generalization of theorems of Lewin and Gallai
• scientific article; zbMATH DE number 1990679
• t-expansive and t-wise intersecting hypergraphs
• Extensions of Gallai's graph covering theorems for uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3873384 (Why is no real title available?)
• scientific article; zbMATH DE number 4137820 (Why is no real title available?)
• scientific article; zbMATH DE number 3929834 (Why is no real title available?)
• scientific article; zbMATH DE number 3970793 (Why is no real title available?)
• scientific article; zbMATH DE number 4087718 (Why is no real title available?)
• scientific article; zbMATH DE number 3720947 (Why is no real title available?)
• scientific article; zbMATH DE number 3895100 (Why is no real title available?)
• scientific article; zbMATH DE number 3400927 (Why is no real title available?)
• A matroid generalization of theorems of Lewin and Gallai
• Eulerian Walks in Graphs
• Total domination in graphs
• Two Bounds for the Domination Number of a Graph

Cited in

(18)

• scientific article; zbMATH DE number 1990679 (Why is no real title available?)
• Gallai-type theorems and domination parameters
• Independence-domination duality
• On vertex independence number of uniform hypergraphs
• scientific article; zbMATH DE number 3871413 (Why is no real title available?)
• Critical hypergraphs and interesting set-pair systems
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• On generalised minimal domination parameters for paths
• t-expansive and t-wise intersecting hypergraphs
• Variations on the Roy-Gallai theorem
• Graphs with constant sum of domination and inverse domination numbers
• Using maximality and minimality conditions to construct inequality chains
• Well irredundant graphs
• Extensions of Gallai's graph covering theorems for uniform hypergraphs
• Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs
• Matchability and \(k\)-maximal matchings
• Gallai's question and constructions of almost hypotraceable graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Gallai theorems for graphs, hypergraphs, and set systems

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