A simple linear time algorithm for triangulating three-colored graphsBODLAENDER, H; KLOKS, T.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 160-172, issn 0196-6774Article

Coloring the Cartesian sum of graphsDER-FEN LIU, Daphne; XUDING ZHU.Discrete mathematics. 2008, Vol 308, Num 24, pp 5928-5936, issn 0012-365X, 9 p.Article

Topological aspects of edge fusions in 4-graphsFERRI, M; LINS, S.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 2, pp 227-243, issn 0095-8956Article

Embedding finite graphs into graphs colored with infinitely many colorsHAJNAL, A.Israel Journal of Mathematics. 1991, Vol 73, Num 3, pp 309-319, issn 0021-2172Article

RECONSTRUCTING COLORED GRAPHS.WEINSTEIN JM.1975; PACIF. J. MATH.; U.S.A.; DA. 1975; VOL. 57; NO 1; PP. 307-314; BIBL. 4 REF.Article

Brooks' Theorem via the Alon-Tarsi TheoremHLADKY, Jan; KRAL, Daniel; SCHAUZ, Uwe et al.Discrete mathematics. 2010, Vol 310, Num 23, pp 3426-3428, issn 0012-365X, 3 p.Article

List-edge and list-total colorings of graphs embedded on hyperbolic surfacesJIANLIANG WU; PING WANG.Discrete mathematics. 2008, Vol 308, Num 24, pp 6210-6215, issn 0012-365X, 6 p.Article

Doubly-colored graphs as graphical models for subductions of coset representations, double cosets, and unit subduced cycle indicesFUJITA, Shinsaku; EL-BASIL, Sherif.Journal of mathematical chemistry. 2004, Vol 36, Num 3, pp 211-229, issn 0259-9791, 19 p.Article

Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity resultsBENKOUAR, A; MANOUSSAKIS, Y; PASCHOS, V. T et al.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 4, pp 417-438, issn 0399-0559Article

Colourings of graphs with two consecutive odd cycle lengthsCAMACHO, Stephan Matos; SCHIERMEYER, Ingo.Discrete mathematics. 2009, Vol 309, Num 15, pp 4916-4919, issn 0012-365X, 4 p.Conference Paper

List colourings of planar graphsVOIGT, Margit.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 1076-1079, issn 0012-365X, 4 p.Article

Some colouring problems for Paley graphsMAISTRELLI, E; PENMAN, D. B.Discrete mathematics. 2006, Vol 306, Num 1, pp 99-106, issn 0012-365X, 8 p.Article

Colored object programming : Ergonomic and cognitive issuesBORRON, H. J.Ergonomie et informatique avancée. Colloque. 1996, pp 139-148, isbn 2-9503134-8-5Conference Paper

An enumerating function for spanning forests with color restrictionsBAPAT, R. B; CONSTANTINE, G.Linear algebra and its applications. 1992, Vol 173, pp 231-237, issn 0024-3795Article

Hadwiger numbers and over-dominating colouringsBÖHME, Thomas; KOSTOCHKA, Alexandr; THOMASON, Andrew et al.Discrete mathematics. 2010, Vol 310, Num 20, pp 2662-2665, issn 0012-365X, 4 p.Article

2-distance (Δ + 2)-coloring of planar graphs with girth six and Δ ≥ 18BORODIN, O. V; IVANOVA, A. O.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6496-6502, issn 0012-365X, 7 p.Article

Set colourings of graphsBOLLOBAS, Béla; THOMASON, Andrew.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 948-952, issn 0012-365X, 5 p.Article

r-Strong edge colorings of graphsAKBARI, S; BIDKHORI, H; NOSRATI, N et al.Discrete mathematics. 2006, Vol 306, Num 23, pp 3005-3010, issn 0012-365X, 6 p.Conference Paper

On the oriented chromatic number of graphs with given excessMOHAMMAD HOSSEINI DOLAMA; SOPENA, Eric.Discrete mathematics. 2006, Vol 306, Num 13, pp 1342-1350, issn 0012-365X, 9 p.Article

Applications of Ramsey theoryROBERTS, F. S.Discrete applied mathematics. 1984, Vol 9, Num 3, pp 251-261, issn 0166-218XArticle

The skew chromatic index of a graphFOREGGER, M. F.Discrete mathematics. 1984, Vol 49, Num 1, pp 27-39, issn 0012-365XArticle

Face colorings of embedded graphsARCHDEACON, D.Journal of graph theory. 1984, Vol 8, Num 3, pp 387-398, issn 0364-9024Article

On Schmerl's effective version of Brooks' theoremTVERBERG, H.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 27-30, issn 0095-8956Article

The chromaticity of wheelsSHAO-JI XU; NIAN-ZU LI.Discrete mathematics. 1984, Vol 51, Num 2, pp 207-212, issn 0012-365XArticle

Coloring graphs with stable cutsetsTUCKER, A.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 258-267, issn 0095-8956Article