Strong conflict-free connection of graphs (Q2284053): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q831023
Created claim: Wikidata QID (P12): Q127310719, #quickstatements; #temporary_batch_1722343634948
 
(5 intermediate revisions by 5 users not shown)
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: W2970205223 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1901.08240 / 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: On conflict-free connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow disconnection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free vertex connection number at most 3 and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong proper connection number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Strong) conflict-free connectivity: algorithm and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free vertex-connections of graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127310719 / rank
 
Normal rank

Latest revision as of 13:52, 30 July 2024

scientific article
Language Label Description Also known as
English
Strong conflict-free connection of graphs
scientific article

    Statements

    Identifiers

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