Proper connection numbers of complementary graphs (Q723592): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Xue Liang Li / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1629130479 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.02414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / 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: The rainbow connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of a Graph and its Complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection numbers of complementary 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: Rainbow connection of graphs with diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank

Latest revision as of 05:20, 16 July 2024

scientific article
Language Label Description Also known as
English
Proper connection numbers of complementary graphs
scientific article

    Statements

    Proper connection numbers of complementary graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    proper path
    0 references
    proper connection number
    0 references
    complement graph
    0 references
    diameter
    0 references
    Nordhaus-Gaddum-type
    0 references
    0 references
    0 references