Optimal proper connection of graphs

DOI10.1007/s11590-019-01442-9zbMath1452.05058arXiv1903.03311OpenAlexW2955885226WikidataQ127718481 ScholiaQ127718481MaRDI QIDQ2192984

Shinya Fujita

Publication date: 24 August 2020

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

edge-colored graphproper connectionoptimal proper connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The optimal proper connection number of a graph with given independence number

Cites Work

• Unnamed Item
• Proper connection of graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• Hamiltonian circuits determining the order of chromosomes
• On two conjectures about the proper connection number of graphs
• Proper connection with many colors
• Minimum degree conditions for the proper connection number of graphs
• Upper bounds of proper connection number of graphs

This page was built for publication: Optimal proper connection of graphs