Note on vertex and total proper connection numbers

DOI10.1016/J.AKCEJ.2016.06.003MaRDI QIDQ334117zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

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

Cites work

• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
• Proper connection of graphs
• Proper connection with many colors
• Total rainbow \(k\)-connection in 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
• Odd connection and odd vertex-connection of graphs
• On the (di)graphs with (directed) proper connection number two
• 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)