On conflict-free connection of graphs
type: Item
instance of: scholarly article
title: On conflict-free connection of graphs
zbMATH Open document ID: 1405.05055
author: Hong Chang
author: Zhong Huang
author: Yaping Mao
author: Xueliang Li
author: Haixing Zhao
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7027134
zbMATH Keywords: edge-coloring
zbMATH Keywords: connectivity
zbMATH Keywords: conflict-free connection number
zbMATH Keywords: Nordhaus-Gaddum-type result
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.006
OpenAlex ID: W2891323680
cites work: A graph and its complement with specified properties. I: Connectivity
cites work: A survey of Nordhaus-Gaddum type relations
cites work: Deterministic conflict-free coloring for intervals
cites work: Q5422499
cites work: Graphs with conflict-free connection number two
cites work: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
cites work: Graph unique-maximum and conflict-free colorings
cites work: Online Conflict‐Free Coloring for Intervals
cites work: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
cites work: Conflict-free connections of graphs
cites work: Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
cites work: Conflict-free connection numbers of line graphs
cites work: Conflict-Free Colorings of Rectangles Ranges
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Conflict-free coloring of points and simple regions in the plane
cites work: Nordhaus-Gaddum inequalities for domination in graphs
cites work: The Diameter of a Graph and its Complement
cites work: The connectivity of a graph and its complement
cites work: Properly Colored Connectivity of Graphs
cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
cites work: Rainbow connections of graphs: a survey
cites work: Maximum value of conflict-free vertex-connection number of graphs
cites work: Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
cites work: Conflict-free vertex-connections of graphs
cites work: On Complementary Graphs
cites work: Conflict-Free Colourings of Graphs and Hypergraphs
cites work: Q5692720
cites work: A note on Nordhaus-Gaddum inequalities for domination.
cites work: Q3377651
DOI: 10.1016/J.DAM.2018.08.006
description: scientific article; zbMATH DE number 7027134