Interpolation theorems for domination numbers of a graph
From MaRDI portal
Publication:1584415
DOI10.1016/S0012-365X(98)00108-3zbMATH Open0958.05103MaRDI QIDQ1584415FDOQ1584415
Authors: Jerzy Topp, Preben Dahl Vestergaard
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Total domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Title not available (Why is that?)
- Properties of Hereditary Hypergraphs and Middle Graphs
- Relations between packing and covering numbers of a tree
- Title not available (Why is that?)
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- Title not available (Why is that?)
- Interpolation theorem for diameters of spanning trees
- Title not available (Why is that?)
- Chordal graphs and upper irredundance, upper domination and independence
- Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
- Interpolation theorem for the number of end‐vertices of spanning trees
- Maximum versus minimum invariants for graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Interpolation theorems on graph parameters
- Title not available (Why is that?)
- Interpolation properties of domination parameters of a graph
- Interpolation theorem for a continuous function on orientations of a simple graph
- On an interpolation property of outerplanar graphs
- 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?)
- Interpolation theorems for graphs, hypergraphs and matroids
This page was built for publication: Interpolation theorems for domination numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584415)