Some results on the total proper \(k\)-connection number

DOI10.1515/math-2022-0025zbMath1485.05066OpenAlexW4226134010MaRDI QIDQ2135063

Hui Zhang, Yingbin Ma

Publication date: 4 May 2022

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2022-0025

zbMATH Keywords

clique numbertotal coloringcomplement graphtotal proper pathtotal proper \(k\)-connectedtotal proper \(k\)-connection number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Total rainbow connection number and complementary graph
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Total rainbow \(k\)-connection in graphs
• Proper connection of graphs
• Proper connection numbers of complementary graphs
• Proper connection number and connected dominating sets
• On (strong) proper vertex-connection of graphs
• Rainbow vertex connection of digraphs
• Proper connection number of graph products
• Rainbow connection numbers of Cayley digraphs on abelian groups
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• On the total proper connection of graphs
• Rainbow connection number and graph operations
• Proper connection and size of graphs
• Graphs with small total rainbow connection number
• Rainbow connection numbers of Cayley graphs
• Rainbow connection number and connected dominating sets
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Some results on the total proper \(k\)-connection number