Constrained Ramsey numbers of graphs
From MaRDI portal
Publication:4798124
DOI10.1002/JGT.10072zbMATH Open1012.05115OpenAlexW4249335099WikidataQ105583232 ScholiaQ105583232MaRDI QIDQ4798124FDOQ4798124
Authors: Robert E. Jamison, Tao Jiang, Alan C. H. Ling 
Publication date: 19 March 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10072
Recommendations
Cites Work
Cited In (18)
- On an anti-Ramsey threshold for random graphs
- Orientable edge colorings of graphs
- Two-edge colorings of graphs with bounded degree in both colors
- Rainbow decompositions
- Rainbow generalizations of Ramsey theory: A survey
- Constrained Ramsey Numbers
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Title not available (Why is that?)
- An anti-Ramsey condition on trees
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Constrained Ramsey numbers
- Bounds for bipartite rainbow Ramsey numbers
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- An Upper Bound for Constrained Ramsey Numbers
- Constrained Ramsey numbers for rainbow matching
- Properly edge-coloured subgraphs in colourings of bounded degree
- Some rainbow cycles in \(r\)-good edge-colorings
- Rainbow faces in edge-colored plane graphs
This page was built for publication: Constrained Ramsey numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798124)
