Note on vertex and total proper connection numbers

DOI10.1016/J.AKCEJ.2016.06.003zbMath1348.05112OpenAlexW2461866425MaRDI QIDQ334117

Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani

Publication date: 31 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.06.003

zbMATH Keywords

colored connectivityproper connectionvertex proper connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (5)

The conflict-free vertex-connection number and degree conditions of graphs ⋮ Unnamed Item ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two

Cites Work

• Unnamed Item
• Total rainbow \(k\)-connection in graphs
• Proper connection of graphs
• Rainbow connections of graphs: a survey
• Proper connection with many colors
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen

This page was built for publication: Note on vertex and total proper connection numbers