On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2585379412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized domination and efficient domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Clique-Width of H-free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient domination for classes of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Polynomial Cases of the Weighted Efficient Domination Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient domination for some classes of \(H\)-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for unipolar and generalized split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and Efficient Domination on <i>P</i><sub>6</sub>-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Efficiently Dominatable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted perfect domination problem and its variants / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:05, 15 July 2024

scientific article; zbMATH DE number 6857265
Language Label Description Also known as
English
On efficient domination for some classes of \(H\)-free chordal graphs
scientific article; zbMATH DE number 6857265

    Statements

    On efficient domination for some classes of \(H\)-free chordal graphs (English)
    0 references
    0 references
    0 references
    9 April 2018
    0 references
    efficient dominating set
    0 references
    weighted efficient domination
    0 references

    Identifiers