Optimal strong parity edge-coloring of complete graphs-Reference-Cited by-同舟云学术

Optimal strong parity edge-coloring of complete graphs

Published:2008-11 Issue:6 Volume:28 Page:625-632
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Bunde David P.,Milans Kevin,West Douglas B.,Wu Hehui

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-008-2364-3.pdf

Reference15 articles.

1. N. Alon: Combinatorial Nullstellensatz, Combin., Prob., Comput. 8 (1999), 7–29.

2. N. Alon, J. Grytczuk, M. Hałuszczak and O. Riordan: Nonrepetitive colorings of graphs, Random Structures Algorithms 21 (2002), 336–346.

3. B. Bollobás: The art of mathematics. Coffee time in Memphis; Cambridge University Press, New York, 2006, page 186.

4. B. Bollobás and I. Leader: Sums in the grid, Discrete Math. 162 (1996), 31–48.

5. D. P. Bunde, K. Milans, D. B. West, and H. Wu: Parity and strong parity edge-coloring of graphs, in Proc. 38th SE Intl. Conf. Comb., Graph Th., Comput., Congressus Numer. 187 (2007), 193–213.

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

1. 1-planar graphs are odd 13-colorable;Discrete Mathematics;2023-08

2. Facial Parity 9-Edge-Coloring of Outerplane Graphs;Graphs and Combinatorics;2014-09-25

3. Improved bound on facial parity edge coloring;Discrete Mathematics;2013-10

4. Facial parity edge colouring of plane pseudographs;Discrete Mathematics;2012-09

5. Facial parity edge coloring of outerplane graphs;Ars Mathematica Contemporanea;2012-03-28