4 papers
Degree sum conditions for a graph to have bounded conflict-free connection number
Dinh Hanh Dang, Trung Duy Doan, Pham Hoang Ha +1
A path in an edge-coloured graph is called \emph{conflict-free} if a colour is exclusively applied to one of its edges. A graph is considered \emph{conflict-free connected} if…
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
Christoph Brause, Trung Duy Doan, Přemysl Holub +4
For every graph , we consider the class of all connected -free graphs which are distinct from an odd cycle and have independence number at least , and we show…
Proper rainbow connection number of graphs
Trung Duy Doan, Ingo Schiermeyer
A path in an edge-coloured graph is called \emph{rainbow path} if its edges receive pairwise distinct colours. An edge-coloured graph is said to be \emph{rainbow connected} if any…
Graphs with conflict-free connection number two
Hong Chang, Trung Duy Doan, Zhong Huang +3
An edge-colored graph is \emph{conflict-free connected} if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The \emph{c…