Maximum value of conflict-free vertex-connection number of graphs (Q4554541): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.01225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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 connections 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: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Graphs and Hypergraphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2884611810 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 09:29, 30 July 2024

scientific article; zbMATH DE number 6979568
Language Label Description Also known as
English
Maximum value of conflict-free vertex-connection number of graphs
scientific article; zbMATH DE number 6979568

    Statements