Conflict-free connection number of graphs with four bridges (Q6045132): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with conflict-free connection number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection of trees / 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: Conflict-free connection numbers of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free (vertex)-connection numbers of graphs with small diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for three kinds of colored connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection number and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conflict-free connection of graphs / rank
 
Normal rank

Latest revision as of 06:13, 1 August 2024

scientific article; zbMATH DE number 7689549
Language Label Description Also known as
English
Conflict-free connection number of graphs with four bridges
scientific article; zbMATH DE number 7689549

    Statements