Coloring vertices and edges of a graph by nonempty subsets of a set-Reference-Cited by-同舟云学术

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

Coloring vertices and edges of a graph by nonempty subsets of a set

Published:2011-05 Issue:4 Volume:32 Page:533-537
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Balister P.N.,Győri E.,Schelp R.H.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference2 articles.

1. Set colorings of graphs;Hegde;European J. Combin.,2009

2. A note on ternary sequences of 0 and 1;Mehta;AKCE Int. J. Graphs Comb.,2008

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

1. Finding pairwise disjoint vector pairs in F_2^n with a prescribed sequence of differences;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

2. Technology Versus Tradition: Game Theoretic Model for Human-Animal Conflict in the Evolution of Digital Society;Advanced Technologies and Societal Change;2022

3. Set-sequential labelings of odd trees;Discussiones Mathematicae Graph Theory;2021

4. New classes of set-sequential trees;Discrete Mathematics;2020-03

5. Monochromatic tree covers and Ramsey numbers for set-coloured graphs;Discrete Mathematics;2018-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP