Conflict-free connection of trees

DOI10.1007/s10878-018-0363-xzbMath1479.05096arXiv1712.10010OpenAlexW2963588339MaRDI QIDQ2051900

Jingshu Zhang, Hong Chang, Meng Ji, Xue Liang Li

Publication date: 25 November 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

treeconflict-free coloringedge ranking\(cfc\)-criticalconflict-free connection coloring

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Conflict-free connection number of graphs with four bridges ⋮ Conflict-free (vertex)-connection numbers of graphs with small diameters ⋮ Conflict-free connection number and independence number of a graph ⋮ Conflict-free vertex-connections of graphs ⋮ Strong conflict-free connection of graphs ⋮ Some results on strong conflict-free connection number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph unique-maximum and conflict-free colorings
• On an edge ranking problem of trees and graphs
• Edge ranking of graphs is hard
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• On conflict-free connection of graphs
• Optimal edge ranking of trees in polynomial time
• Rainbow connections of graphs: a survey
• Conflict-free coloring of points and simple regions in the plane
• Parity vertex colorings of binomial trees
• Parity vertex colouring of graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Rankings of Graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Maximum value of conflict-free vertex-connection number of graphs
• Properly Colored Connectivity of Graphs
• Deterministic conflict-free coloring for intervals
• Conflict-Free Coloring and its Applications
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• Online Conflict‐Free Coloring for Intervals
• Conflict-Free Colorings of Rectangles Ranges
• Optimal edge ranking of trees in linear time