3-consecutive edge coloring of a graph-Reference-Cited by-同舟云学术

3-consecutive edge coloring of a graph

Published:2012-02 Issue:3 Volume:312 Page:561-573
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Bujtás Cs.,Sampathkumar E.,Tuza Zs.,Dominic Ch.,Pushpalatha L.

Funder

Department of Science and Technology, Government of India

Hungarian Scientific Research Fund

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference13 articles.

1. Matching cutsets in graphs of diameter 2;Borowiecki;Theoretical Computer Science,2008

2. On stable cutsets in graphs;Brandstädt;Discrete Applied Mathematics,2000

3. Cs. Bujtás, E. Sampathkumar, Zs. Tuza, Ch. Dominic, L. Pushpalatha, When the vertex coloring of a graph is an edge coloring of its line graph — A rare coincidence, manuscript, 2010.

4. Improper C-colorings of graphs;Bujtás;Discrete Applied Mathematics,2011

5. 3-consecutive C-colorings of graphs;Bujtás;Discussiones Mathematicae Graph Theory,2010

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

1. Edge incident 2-edge coloring of graphs;Discrete Mathematics, Algorithms and Applications;2024-05-10

2. Vertex neighborhood restricted edge achromatic sums of graphs;Discrete Mathematics, Algorithms and Applications;2022-11-15

3. 3-Sequent achromatic sum of graphs;Discrete Mathematics, Algorithms and Applications;2020-12-03

4. Injective edge coloring of graphs;Filomat;2019

5. Maximum number of colors: C-coloring and related problems;Journal of Geometry;2011-08