Edge colorings of complete graphs without tricolored triangles-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Edge colorings of complete graphs without tricolored triangles

Published:2004-04-05 Issue:3 Volume:46 Page:211-216
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Gyárfás András,Simonyi Gábor

Funder

OTKA (to A.G.)

OTKA (to G.S.)

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference12 articles.

1. A. Bialostocki P. Dierker W. Voxman Either a graph or its complement is connected: A continuing saga

2. On monochromatic-rainbow generalizations of two Ramsey-type theorems;Bialostocki;Ars Combinatoria,2003

3. S. A. Burr Either a graph or its complement contains a spanning broom

4. Lambda composition;Cameron;J Graph Theory,1997

5. A note on perfect graphs, Period Math;Cameron;Hungar,1986

Cited by 91 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum‐degree conditions for rainbow triangles;Journal of Graph Theory;2024-05-15

2. Colored Unavoidable Patterns and Balanceable Graphs;The Electronic Journal of Combinatorics;2024-05-03

3. Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates;Combinatorica;2024-04-29

4. Gallai–Ramsey Multiplicity;Graphs and Combinatorics;2024-04-14

5. Complete bipartite graphs without small rainbow subgraphs;Discrete Applied Mathematics;2024-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP