Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-015-9917-3 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9917-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2252286593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling algorithms for paired-domination problems in block and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithm for the paired-domination problem in convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the minimum independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Hardness Results on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets on restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Bipartite Graphs: Comparison and Hardness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable connected domination for restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Union Closed Tree Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Some Subclasses of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination on Tree Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets on Tree Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-015-9917-3 / rank
 
Normal rank

Latest revision as of 14:32, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
scientific article

    Statements

    Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2016
    0 references
    NP-completeness
    0 references
    domination
    0 references
    Hamiltonianicity
    0 references
    treewidth
    0 references
    tree convex bipartite graphs
    0 references
    0 references

    Identifiers