Properties of Hereditary Hypergraphs and Middle Graphs
From MaRDI portal
Publication:4175592
DOI10.4153/CMB-1978-079-5zbMath0393.05044MaRDI QIDQ4175592
No author found.
Publication date: 1978
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
DominanceGraphsConnectivityChromatic NumberIntersectionIrredundanceLine GraphsProperties of Hereditary Hypergraphs And Middle GraphsTraversabilityVertex Independence
Related Items
Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties, Isolate domination in graphs, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Outer-connected independence in graphs, Irredundance perfect graphs, Domination and irredundance in cubic graphs, Gallai-type theorems and domination parameters, On the product of upper irredundance numbers of a graph and its complement, Well irredundant graphs, Using maximality and minimality conditions to construct inequality chains, Irredundance in grids, Domination by queens on a square beehive, Some inequalities about connected domination number, THE IRREDUNDANT RAMSEY NUMBER s(3,6), Maximal irredundant functions, Domination chain: characterisation, classical complexity, parameterised complexity and approximability, Irredundance trees of diameter 3, Recognizing well-dominated graphs is coNP-complete, On (r,s)-Fuzzy Domination in Fuzzy Graphs, Zero-divisor graphs of small upper irredundance number, Coalescence and criticality of graphs, Extremal graphs for a new upper bound on domination parameters in graphs, Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, Stratification and domination in graphs, Contributions to the theory of domination, independence and irredundance in graphs, Independence and upper irredundance in claw-free graphs, New bounds for the broadcast domination number of a graph, Relations between the lower domination parameters and the chromatic number of a graph., Vertex-edge domination in graphs, Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity, Towards a new framework for domination, Iterated colorings of graphs., Unnamed Item, Extended chain of domination parameters in graphs, Chordal graphs and upper irredundance, upper domination and independence, Irredundance number versus domination number, Queen's domination using border squares and \((A,B)\)-restricted domination, On -domination in graphs, The enclaveless competition game, Dominating and irredundant broadcasts in graphs, Irredundancy in circular arc graphs, A note on graphs which have upper irredundance equal to independence, Irredundant ramsey numbers for graphs, A lower bound for the CO-irredundance number of a graph, A semi-induced subgraph characterization of upper domination perfect graphs, Enumeration and maximum number of maximal irredundant sets for chordal graphs, On the Complexity Landscape of the Domination Chain, On graph fall-coloring: existence and constructions, Min-max and max-min graph saturation parameters, A Roman domination chain, Irredundant ramsey numbers for graphs, Irredundance, The Private Neighbor Concept, Models of Domination in Graphs, Roman Domination in Graphs, Inequalities relating domination parameters in cubic graphs, On the ratios between packing and domination parameters of a graph, A Characterization of the extended DII-sequence, Irredundance graphs, Minus domination in graphs, Interpolation theorems for domination numbers of a graph, On the differences between the upper irredundance, upper domination and independence numbers of a graph, The irredundance number and maximum degree of a graph, The edge signal number of a graph, Unique irredundance, domination and independent domination in graphs, Vertex sequences in graphs, The sequence of upper and lower domination, independence and irredundance numbers of a graph, Bibliography on domination in graphs and some basic definitions of domination parameters
