On the total proper connection of graphs
From MaRDI portal
Publication:2272614
DOI10.1007/s40840-019-00767-zzbMath1419.05075arXiv1512.00726MaRDI QIDQ2272614
Hui Jiang, Yingying Zhang, Xue Liang Li
Publication date: 20 September 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.00726
05C35: Extremal problems in graph theory
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
05C40: Connectivity
05C07: Vertex degrees
Related Items
Nordhaus-Gaddum-type theorem for total-proper connection number of graphs, (Strong) total proper connection of some digraphs, Some results on the total proper \(k\)-connection number
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizations of graphs having large proper connection numbers
- Upper bounds for the total rainbow connection of graphs
- Total rainbow \(k\)-connection in graphs
- Proper connection of graphs
- On rainbow total-coloring of a graph
- Approximating the chromatic index of multigraphs
- Proper connection number of random graphs
- On (strong) proper vertex-connection of graphs
- The list chromatic index of a bipartite multigraph
- Rainbow connections of graphs: a survey
- Upper bounds of proper connection number of graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Vertex-distinguishing proper edge-colorings
- Properly Colored Connectivity of Graphs