5 citations · 9 across the 6 of their papers we have counts for
10 papers · 1 filter
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…
Gallai-Ramsey number for the union of stars
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of the complete graph…
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…
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
Ramsey and Gallai-Ramsey number for wheels
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
Christoph Brause, Přemysl Holub, Adam Kabela +3
Considering connected -free graphs with independence number at least , Chudnovsky and Seymour (2010) showed that every such graph, say , is -colourable where …