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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963101151 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1806.00386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / 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: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dilworth number of auto-chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient domination and efficient edge domination: a brief survey / 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: Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / 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: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorial properties of chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the clique-width of \(H\)-free bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite graphs without a skew star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite graphs of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination problem on some perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Efficiently Dominatable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:48, 20 July 2024

scientific article
Language Label Description Also known as
English
On efficient domination for some classes of \(H\)-free bipartite graphs
scientific article

    Statements

    On efficient domination for some classes of \(H\)-free bipartite graphs (English)
    0 references
    0 references
    0 references
    6 November 2019
    0 references
    weighted efficient domination
    0 references
    \(H\)-free bipartite graphs
    0 references
    NP-completeness
    0 references
    polynomial time algorithm
    0 references
    clique-width
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers