Graphs with conflict-free connection number two (Q1756118): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129005386, #quickstatements; #temporary_batch_1730771707833
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Stanlislav Jendroľ / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
Normal rank
 
Property / author
 
Property / author: Stanlislav Jendroľ / 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: W2963062619 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1707.01634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection and size of graphs / 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: Minimum degree conditions for the proper connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph unique-maximum and conflict-free colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection numbers of line 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: Proper connection number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree condition for proper connection number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of graphs having large proper connection numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Graphs and Hypergraphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129005386 / rank
 
Normal rank

Latest revision as of 02:55, 5 November 2024

scientific article
Language Label Description Also known as
English
Graphs with conflict-free connection number two
scientific article

    Statements

    Graphs with conflict-free connection number two (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    edge-coloring
    0 references
    conflict-free connection number
    0 references
    degree condition
    0 references

    Identifiers

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