Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Complexity results for the proper disconnection of graphs
You Chen
,
Ping Li
,
Xueliang Li
,
Yindi Weng
Type:
Article
Publication Date:
2019-12-21
Citations:
0
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Complexity Results for the Proper Disconnection of Graphs
2020
You Chen
Ping Li
Xueliang Li
Yindi Weng
+
PDF
Chat
Proper Disconnection of Graphs
2021
Xuqing Bai
You Chen
Meng Ji
Xueliang Li
Yindi Weng
Wenyan Wu
+
Proper disconnection of graphs
2019
Xuqing Bai
You Chen
Meng Ji
Xueliang Li
Yindi Weng
Wenyan Wu
+
Complexity results for two kinds of colored disconnections of graphs
2019
You Chen
Ping Li
Xueliang Li
Yindi Weng
+
Optimal proper connection of graphs
2019
Shinya Fujita
+
Proper connection number and 2-proper connection number of a graph
2015
Fei Huang
Xueliang Li
Shujing Wang
+
Hardness results for rainbow disconnection of graphs
2018
Zhong Huang
Xueliang Li
+
Distance proper connection of graphs
2016
Xueliang Li
Colton Magnant
Meiqin Wei
Xiaoyu Zhu
+
Distance proper connection of graphs and their complements
2016
Xueliang Li
Colton Magnant
Meiqin Wei
Xiaoyu Zhu
+
Proper connection of graphs
2011
Valentin Borozan
Shinya Fujita
Aydin Gerek
Colton Magnant
Yannis Manoussakis
Leandro Montero
Ĺšsolt Tuza
+
The proper diameter of a graph
2018
Vincent E. Coll
Jonelle Hook
Colton Magnant
Karen McCready
Kathleen Ryan
+
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
2022
Jungho Ahn
Seonghyuk Im
Sangâil Oum
+
Some upper bounds for the $3$-proper index of graphs
2016
Hong Chang
Xueliang Li
Zhongmei Qin
+
PDF
Chat
The Proper Conflict-Free $K$-Coloring Problem and the Odd $K$-Coloring Problem are Np-Complete on Bipartite Graphs
2023
Jungho Ahn
Seonghyuk Im
Sangâil Oum
+
PDF
Chat
Proper connection number of bipartite graphs
2018
Jun Yue
Meiqin Wei
Yan Zhao
+
Proper connection number and connected dominating sets
2015
Xueliang Li
Meiqin Wei
Jun Yue
+
Proper connection numbers of complementary graphs
2015
Fei Huang
Xueliang Li
Shujing Wang
+
Proper and weak-proper trees in edges-colored graphs and multigraphs
2011
Valentin Borozan
+
Strong rainbow disconnection in graphs
2020
Xuqing Bai
Xueliang Li
+
Sharp NordhausâGaddum-Type Lower Bounds for Proper Connection Numbers of Graphs
2018
Yuefang Sun
Works That Cite This (0)
Action
Title
Year
Authors
Works Cited by This (0)
Action
Title
Year
Authors