1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2017★ 1 cited
Colorings with Fractional Defect
Wayne Goddard, Honghai Xu
Consider a coloring of a graph such that each vertex is assigned a fraction of each color, with the total amount of colors at each vertex summing to . We define the fractional d…
math.CO2016
A Note on Bipartite Subgraphs and Triangle-independent Sets
Honghai Xu
Let denote the maximum size of an edge set that contains at most one edge from each triangle of . Let denote the minimum size of an edge set whose deleti…
math.CO2016★ 1 cited
Vertex Colorings without Rainbow or Monochromatic Subgraphs
Wayne Goddard, Honghai Xu
This paper investigates vertex colorings of graphs such that some rainbow subgraph~ and some monochromatic subgraph are forbidden. Previous work focussed on the case that $R…