Coloring k-trees with forbidden monochrome or rainbow triangles

MaRDI QIDQ2820201zbMATH OpenFDO

Authors Julian A. Allagan, V. I. Voloshin

Publication date 14 September 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p137.pdf

zbMATH Keywords

\((\mathcal H,H)\)-good coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Colourings of (k-r,k)-trees
• scientific article; zbMATH DE number 4132187
• Rainbow trees in uniformly edge‐colored graphs
• Rainbow monochromatic \(k\)-edge-connection colorings of graphs
• On vertex coloring without monochromatic triangles
• THE COLORING OF THE TREE OF COLORINGS
• Chromatic numbers of spaces with forbidden monochromatic triangles
• On graphs with a large number of edge-colorings avoiding a rainbow triangle
• Coloring of trees with minimum sum of colors
• Rainbow triangles in edge-colored Kneser graphs

Cited in

(2)

• A note on the monotonicity of mixed Ramsey numbers
• Colourings of (k-r,k)-trees

This page was built for publication: Coloring \(k\)-trees with forbidden monochrome or rainbow triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820201)