Conflict-free connection number of random graphs

DOI10.1016/j.dam.2020.01.034zbMath1442.05057arXiv1809.03582OpenAlexW3006476046MaRDI QIDQ2192106

Ran Gu, Xue Liang Li

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.03582

zbMATH Keywords

random graphsedge-coloringconflict-free connection number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rainbow-\(k\)-connectivity of random graphs
• Proper connection of graphs
• Graph unique-maximum and conflict-free colorings
• Proper connection number of random graphs
• On two Hamilton cycle problems in random graphs
• On rainbow connection
• Hamiltonian circuits in random graphs
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• On conflict-free connection of graphs
• Graphs with conflict-free connection number two
• Rainbow connections of graphs: a survey
• Rainbow connection of sparse random graphs
• Conflict-free vertex-connections of graphs
• (Strong) conflict-free connectivity: algorithm and complexity
• Properties of almost all graphs and complexes
• Rainbow connection in graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Almost all regular graphs are hamiltonian
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Properly Colored Connectivity of Graphs
• Paths in graphs
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

This page was built for publication: Conflict-free connection number of random graphs