Algorithm on rainbow connection for maximal outerplanar graphs (Q517025): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xing-Chao Deng / rank
Normal rank
 
Property / author
 
Property / author: Gui Ying Yan / rank
Normal rank
 
Property / author
 
Property / author: Xing-Chao Deng / rank
 
Normal rank
Property / author
 
Property / author: Gui Ying Yan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964191086 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.01857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the center and diameter of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361572 / 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: Rainbow connection number and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection of graphs with diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of rainbow connections for planar and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented diameter and rainbow connection number of a graph / rank
 
Normal rank

Latest revision as of 12:59, 13 July 2024

scientific article
Language Label Description Also known as
English
Algorithm on rainbow connection for maximal outerplanar graphs
scientific article

    Statements

    Identifiers

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