Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 87, 2010 - Issue 13
Submit an article Journal homepage
48
Views
0
CrossRef citations to date
0
Altmetric
Section A

Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles

Jianfeng Hou School of Mathematics, Shandong University , Jinan, 250100, China; Center for Discrete Mathematics, Fuzhou University , Fuzhou, 350002, ChinaView further author information
,
Bin Liu School of Mathematics, Shandong University , Jinan, 250100, China
,
Guizhen Liu School of Mathematics, Shandong University , Jinan, 250100, China
&
Jihui Wang School of Science, University of Jinan , Jinan, 250022, China
Pages 2880-2886 | Received 26 Apr 2008, Accepted 07 May 2009, Published online: 23 Aug 2010

References

  • Bu, Y. , and Wang, W. , 2006. Some sufficient conditions for a planar graph of maximum degree six to be class 1 , Discrete Math. 306 (2006), pp. 1440–1445.
  • Choi, H. , and Hakimi, S. L. , 1987. Scheduling file transfers for tree and odd cycles , SIAM J. Comput. 16 (1987), pp. 162–168.
  • Coffman, E. G. , Garey, M. R. , Johnson, D. S. , and LaPauge, A. S. , 1985. Scheduling file transfers , SIAM J. Comput. 14 (1985), pp. 744–780.
  • Hind, H. , and Zhao, Y. , 1998. Edge colorings of graphs embeddable in a surface of low genus , Discrete Math. 190 (1998), pp. 107–114.
  • Li, X. , and Luo, R. , 2003. Edge coloring of embedded graphs with large girth , Graphs Combin. 19 (2003), pp. 393–401.
  • Luo, R. , and Zhang, C. Q. , 2004. Edge coloring of graphs with small average degree , Discrete Math. 275 (2004), pp. 207–218.
  • Mel'nikov, L. S. , 1970. The chromatic class and location of a graph on a closed surface , Mat. Zametki 7 (1970), pp. 671–681, (Math. Notes 7 (1970), 405–411).
  • Sanders, D. , and Zhao, Y. , 2000. Coloring edges of embedded graphs , J. Graph Theory 35 (2000), pp. 197–205.
  • Sanders, D. , and Zhao, Y. , 2001. Planar graphs of maximum degree seven are Class I , J. Combin. Theory B 83 (2001), pp. 201–212.
  • Sanders, D. , and Zhao, Y. , 2003. Coloring edges of graphs embedded in a surface of characteristic zero , J. Combin. Theory B 87 (2003), pp. 254–263.
  • Vizing, V. G. , 1964. On an estimate of the chromatic index of a p-graph , Diskretn. Anal. 3 (1964), pp. 25–30.
  • Vizing, V. G. , 1965. Critical graphs with given chromatic class , Diskretn. Anal. 5 (1965), pp. 9–17.
  • Wang, W. , and Chen, Y. , 2007. A sufficient condition for a planar graph to be class 1 , Theor. Comput. Sci. 385 (2007), pp. 71–77.
  • Zhang, L. , 2000. Every planar graph with maximum degree 7 is of Class 1 , Graphs and Combin. 16 (2000), pp. 467–495.
  • Zhou, G. , 2003. A note on graphs of Class I , Discrete Math. 262 (2003), pp. 339–345.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.