3-consecutive edge coloring of a graph
Authors:
- 6 February 2012
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (3) , 561-573
Abstract
No abstract availableKeywords
Funding Information
- Department of Science and Technology, Government of India (SR/S4/MS:275/05)
- Hungarian Scientific Research Fund (OTKA 81493)
This publication has 8 references indexed in Scilit:
- Improper C-colorings of graphsDiscrete Applied Mathematics, 2011
- 3-consecutive C-colorings of graphsDiscussiones Mathematicae Graph Theory, 2010
- Matching cutsets in graphs of diameter 2Theoretical Computer Science, 2008
- On stable cutsets in claw-free graphs and planar graphsJournal of Discrete Algorithms, 2008
- On stable cutsets in line graphsTheoretical Computer Science, 2003
- A note on fragile graphsDiscrete Mathematics, 2002
- On stable cutsets in graphsDiscrete Applied Mathematics, 2000
- Matching cutsets in graphsJournal of Graph Theory, 1989