Indecomposable factorizations of multigraphsBAARTMANS, A. H; WALLIS, W. D.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 37-43, issn 0012-365X, 7 p.Article

Multipartition seriesWAGNER, D. G.SIAM journal on discrete mathematics (Print). 1996, Vol 9, Num 4, pp 529-544, issn 0895-4801Article

A word problem in Artin semigroupsENOMOTO, H; MIZUTANI, H; TOKUSHIGE, N et al.Discrete mathematics. 1992, Vol 104, Num 2, pp 159-166, issn 0012-365XArticle

The irregularity cost or sum of a graphHARARY, F; JACOBSON, M. S; KUBICKA, E et al.Applied mathematics letters. 1993, Vol 6, Num 3, pp 79-80, issn 0893-9659Article

Exponents of tuples of nonnegative matricesOLESKY, D. D; SHADER, Bryan; VAN DEN DRIESSCHE, P et al.Linear algebra and its applications. 2002, Vol 356, pp 123-134, issn 0024-3795Article

On the enumeration of a class of plane multigraphsREAD, R. C.Aequationes mathematicae (Printed ed.). 1986, Vol 31, Num 1, pp 47-63, issn 0001-9054Article

An NC parallel algorithm for edge-coloring series-parallel multigraphsZHOU, X; SUZUKI, H; NISHIZEKI, T et al.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 359-374, issn 0196-6774Article

On the chromatic index of multigraphs and a conjoncture of SeymourMARCOTTE, O.Journal of combinatorial theory. Series B. 1986, Vol 41, Num 3, pp 306-331, issn 0095-8956Article

Approximation algorithm for chromatic index and edge-coloring of multigraphsKOCHOL, Martin; KRIVONAKOVA, Nada; SMEJOVA, Silvia et al.Lecture notes in computer science. 2005, pp 602-605, issn 0302-9743, isbn 3-540-25920-1, 4 p.Conference Paper

Théorie des Graphes: Cycles Hamiltoniens, coloration d'arêtes et problèmes de pavages = Graph Theory: Hamilton Cycles, Edge Colorings and Tiling ProblemsJurkiewicz, Samuel; Fournier, J.-C.1996, 140 p.Thesis

Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groupsDELORME, C; FAVARON, O; MAHEO, M et al.European journal of combinatorics. 1992, Vol 13, Num 1, pp 59-61, issn 0195-6698Article

Asymptotic enumeration by degree sequence of graphs with degrees o(n^1/2)MCKAY, B. D; WORMALD, N. C.Combinatorica (Print). 1991, Vol 11, Num 4, pp 369-382, issn 0209-9683Article

The chromatic index of multigraphs that are nearly fullPLANTHOLT, M. J; TIPNIS, S. K.Discrete mathematics. 1990, Vol 82, Num 2, pp 197-207, issn 0012-365X, 11 p.Article

A generalization of plantholt's theoremHILTON, A. J. W.Journal of graph theory. 1986, Vol 10, Num 4, pp 523-527, issn 0364-9024Article

Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree paritiesBENDER, E. A; RICHMOND, L. B.Journal of graph theory. 1986, Vol 10, Num 1, pp 41-46, issn 0364-9024Article

On the scale-free intersection graphsXIN YAO; CHANGSHUI ZHANG; JINWEN CHEN et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part II, 1217-1224Conference Paper

Universal covers of graphs: isomorphism to depth n-1 implies isomorphism to all depthsNORRIS, N.Discrete applied mathematics. 1995, Vol 56, Num 1, pp 61-74, issn 0166-218XArticle

Shortness coefficients of simple 3-polytopal graphs with edges of only two typesTKÁČ, M.Discrete mathematics. 1992, Vol 103, Num 1, pp 103-110, issn 0012-365XArticle

Regular multigraphs of high degree are 1-factorizablePLANTHOLT, M. J; TIPNIS, S. K.Journal of the London Mathematical Society. 1991, Vol 44, pp 393-400, issn 0024-6107, 3Article

Simplified existence theorems for (g,f)-factorsANSTEE, R. P.Discrete applied mathematics. 1990, Vol 27, Num 1-2, pp 29-38, issn 0166-218XConference Paper

Applications of edge coloring of multigraphs to vertex coloring of graphsKIERSTEAD, H. A.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 117-124, issn 0012-365XArticle

A note concerning the chromatic index of multigraphsHILTON, A. J. W; JACKSON, B.Journal of graph theory. 1987, Vol 11, Num 3, pp 267-272, issn 0364-9024Article

Subgraphs of 4-Regular Planar GraphsDOWDEN, Chris; ADDARIO-BERRY, Louigi.Algorithmica. 2011, Vol 61, Num 3, pp 758-776, issn 0178-4617, 19 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

Parallel independence in hierarchical graph transformationHABEL, Annegret; HOFFMANN, Berthold.Lecture notes in computer science. 2004, pp 178-193, issn 0302-9743, isbn 3-540-23207-9, 16 p.Conference Paper