Note on vertex and total proper connection numbers

DOI10.1016/J.AKCEJ.2016.06.003zbMATH Open1348.05112OpenAlexW2461866425MaRDI QIDQ334117FDOQ334117

Authors: 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

Recommendations

• On the total proper connection of graphs
• Proper connection number 2, connectivity, and forbidden subgraphs
• On the minimum degree and the proper connection number of graphs
• Proper connection with many colors
• Minimum degree conditions for the proper connection number of graphs

zbMATH Keywords

colored connectivityproper connectionvertex proper connection

Mathematics Subject Classification ID

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

Cites Work

• Total rainbow \(k\)-connection in graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Title not available (Why is that?)
• Proper connection with many colors
• Proper connection of graphs

Cited In (8)

• On the (di)graphs with (directed) proper connection number two
• On the number of \(k\)-proper connected edge and vertex colorings of graphs
• Some results on the total proper \(k\)-connection number
• Some results on (strong) total proper connection number of some digraphs
• Conflict-free vertex connection number at most 3 and size of graphs
• On the (di)graphs with (directed) proper connection number two
• Odd connection and odd vertex-connection of graphs
• The conflict-free vertex-connection number and degree conditions of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334117)