On a class of graphs between threshold and total domishold graphs
DOI10.1016/J.DAM.2014.02.013zbMATH Open1320.05087OpenAlexW1982529066MaRDI QIDQ496435FDOQ496435
Authors: Nina Chiarelli, Martin Milanič 
Publication date: 21 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.013
Recommendations
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Linear separation of total dominating sets in graphs
- Pseudodomishold graphs
- Structure and recognition of domishold graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
total dominationthreshold graphforbidden induced subgraph characterizationlinear-time algorithmtotal domishold graphleaf extension of a threshold graph
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Total domination in graphs
- Equistable graphs
- Total domination in graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- A survey of selected recent results on total domination in graphs
- Open packing, total domination, and the \(P_3\)-Radon number
- On graphs for which the connected domination number is at most the total domination number
- On the existence of total dominating subgraphs with a prescribed additive hereditary property
- Linear Separation of Dominating Sets in Graphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Independent domination in hereditary classes
- Total domination and the Caccetta-Häggkvist conjecture
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Two short proofs on total domination
- Linear separation of total dominating sets in graphs
- Title not available (Why is that?)
- Nordhaus-Gaddum type results for total domination
Cited In (9)
- Linear separation of total dominating sets in graphs
- Title not available (Why is that?)
- Linear separation of connected dominating sets in graphs
- Enumerating threshold graphs and some related graph classes
- Graphs obtained by disjoint unions and joins of cliques and stable sets
- Title not available (Why is that?)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- On the pairwise compatibility property of some superclasses of threshold graphs
- Structure and recognition of domishold graphs
Uses Software
This page was built for publication: On a class of graphs between threshold and total domishold graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496435)
