Conflict-free connection number and independence number of a graph

DOI10.1007/s10255-021-1013-0zbMath1464.05158arXiv2012.04820OpenAlexW3181672760MaRDI QIDQ2025169

Jing Wang, Meng Ji

Publication date: 11 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

treeedge-coloringindependence numberconflict-free connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Some remarks on rainbow connectivity
• Rainbow connection number and independence number of a graph
• Rainbow connection of graphs with diameter 2
• Proper connection of graphs
• Hardness and algorithms for rainbow connection
• Graph unique-maximum and conflict-free colorings
• Unique-maximum coloring of plane 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
• Conflict-free connection of trees
• Conflict-free vertex-connections of graphs
• On two conjectures about the proper connection number of graphs
• Minimum degree conditions for the proper connection number of graphs
• Rainbow connection in sparse graphs
• Rainbow connection in graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Maximum value of conflict-free vertex-connection number of graphs
• Properly Colored Connectivity of Graphs
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

This page was built for publication: Conflict-free connection number and independence number of a graph