2.2k citations
- Peking UniversityCN416 papers
- Tsinghua UniversityCN403 papers
- University of Science and Technology of ChinaCN396 papers
- Shandong UniversityCN373 papers
- Nanjing UniversityCN369 papers
- Shanghai Jiao Tong UniversityCN365 papers
- University of Chinese Academy of SciencesCN350 papers
- Sichuan UniversityCN349 papers
- Beihang UniversityCN348 papers
- Zhengzhou UniversityCN347 papers
- Zhejiang UniversityCN339 papers
- Wuhan UniversityCN337 papers
11 papers · 2 filters
The -positivity of two families of -free graphs
Grace M. X. Li, Arthur L. B. Yang
Motivated by Stanley's conjecture about the -positivity of claw-free incomparability graphs, Hamel and her collaborators studied the -positivity of -free graphs, w…
Spanning Triangle-trees and Flows of Graphs
Jiaao Li, Xueliang Li, Meiling Wang
In this paper we study the flow-property of graphs containing a spanning triangle-tree. Our main results provide a structure characterization of graphs with a spanning triangle-tre…
Proper disconnection of graphs
Xuqing Bai, You Chen, Meng Ji +3
For an edge-colored graph , a set of edges of is called a \emph{proper cut} if is an edge-cut of and any pair of adjacent edges in are assigned by different…
The annihilation number does not bound the 2-domination number from the above
Jun Yue, Shizhen Zhang, Yiping Zhu +2
The -domination number of a graph is the minimum cardinality of a set such that every vertex from is adjacent to at least two ve…
On graphs with no induced five-vertex path or paraglider
Shenwei Huang, T. Karthick
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . For a positive integer , is the chordless…
Exact rainbow numbers for matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi +1
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…