Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.11.023 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2566896946 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1612.07768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and algorithms for rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further hardness results on the rainbow vertex-connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of determining the rainbow vertex-connection of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of rainbow coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Races in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further hardness results on rainbow and strong rainbow connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong rainbow vertex-connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bigeodetic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planar geodetic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rainbow connectivity of graphs: complexity and FPT algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.11.023 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity of rainbow vertex connectivity problems for restricted graph classes
scientific article

    Statements

    Complexity of rainbow vertex connectivity problems for restricted graph classes (English)
    0 references
    0 references
    23 January 2017
    0 references
    rainbow connectivity
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references