Proper connection number of graph products
From MaRDI portal
Publication:1714046
DOI10.1007/s40840-016-0442-zzbMath1406.05035arXiv1505.02246OpenAlexW2098137766MaRDI QIDQ1714046
Yaping Mao, Chengfu Ye, Fengnan Yanling, Zhao Wang
Publication date: 31 January 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/1505.02246
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs
- A characterization of the edge connectivity of direct products of graphs
- Convex sets in lexicographic products of graphs
- Proper connection numbers of complementary graphs
- The vertex-rainbow index of a graph
- Proper connection number and connected dominating sets
- A note on the connectivity of Kronecker products of graphs
- Rainbow connections of graphs: a survey
- Connectivity of strong products of graphs
- Note on the hardness of rainbow connections for planar and line graphs
- On the strong rainbow connection of a graph
- Path-connectivity of lexicographic product graphs
- The rainbow connectivity of a graph
- Rainbow trees in graphs and generalized connectivity
- The Kronecker Product of Graphs
- Rainbow connection in graphs
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Game coloring the Cartesian product of graphs
- Isomorphic components of Kronecker product of bipartite graphs
- Optimum broadcasting and personalized communication in hypercubes
- Small cycle double covers of products I: Lexicographic product with paths and cycles
- Rainbow vertex-connection and graph products
This page was built for publication: Proper connection number of graph products
