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
Recommendations
hereditary propertiessubgraphsedge covering numbervertex independence numberGallai Theoremspartition of verticesvertex covering number
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)
Cites Work
- Total domination in graphs
- Two Bounds for the Domination Number of a Graph
- Title not available (Why is that?)
- A matroid generalization of theorems of Lewin and Gallai
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eulerian Walks in Graphs
- Title not available (Why is that?)
Cited In (18)
- Independence-domination duality
- Critical hypergraphs and interesting set-pair systems
- Matchability and \(k\)-maximal matchings
- Title not available (Why is that?)
- Extensions of Gallai's graph covering theorems for uniform hypergraphs
- On vertex independence number of uniform hypergraphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs
- Gallai's question and constructions of almost hypotraceable graphs
- Graphs with constant sum of domination and inverse domination numbers
- Gallai-type theorems and domination parameters
- On generalised minimal domination parameters for paths
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Title not available (Why is that?)
- Using maximality and minimality conditions to construct inequality chains
- t-expansive and t-wise intersecting hypergraphs
- Variations on the Roy-Gallai theorem
- Well irredundant graphs
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)
