Cutpoints and the chromatic polynomialWHITEHEAD, E. G. JR; LIAN-CHANG ZHAO.Journal of graph theory. 1984, Vol 8, Num 3, pp 371-377, issn 0364-9024Article

THE DIAMETER AND RADIUS OF SIMPLE GRAPHS.JOHNSON RH.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 2; PP. 188-198; BIBL. 3 REF.Article

Degree sum and nowhere-zero 3-flowsGENGHUA FAN; CHUIXIANG ZHOU.Discrete mathematics. 2008, Vol 308, Num 24, pp 6233-6240, issn 0012-365X, 8 p.Article

ALCUNE NOTEVOLI RELAZIONI FRA PARAMETRI RELATIVI AI GRAFI SEMPLICI = QUELQUES RELATIONS REMARQUABLES ENTRE PARAMETRES RELATIFS A DES GRAPHES SIMPLESOTTAVIANI M.1972; BOLL. UN. MAT. ITAL.; ITAL.; DA. 1972; VOL. 5; NO 3; PP. 444-452; ABS. ANGL.; BIBL. 4 REF.Serial Issue

PROPERTIES OF UNIQUE REALIZATIONS: A SURVEYJOHNSON RH.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 2; PP. 185-192; BIBL. 9 REF.Article

An inequality for degree sequencesSZEKELY, L. A; CLARK, L. H; ENTRINGER, R. C et al.Discrete mathematics. 1992, Vol 103, Num 3, pp 293-300, issn 0012-365XArticle

Geodetic sets and Steiner sets in graphsTONG, Li-Da.Discrete mathematics. 2009, Vol 309, Num 12, pp 4203-4205, issn 0012-365X, 3 p.Article

FINITE HOMOGENEOUS SIMPLE DIGRAPHSLACHLAN AH.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 107; PP. 189-208; BIBL. 15 REF.Conference Paper

NON-HAMILTONIAN SIMPLE PLANAR GRAPHSZAKS J.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 60; PP. 255-263; BIBL. 24 REF.Article

ON THE EDGE-RECONSTRUCTION OF GRAPHS WHICH TRIANGULATE SURFACESFIORINI S; LAURI J.1982; G.J. MATH.; ISSN 0033-5606; GBR; DA. 1982; VOL. 33; NO 130; PP. 191-214; BIBL. 16 REF.Article

THE RELATIONSHIP BETWEEN FIXING SUBGRAPHS AND SMOOTHLY EMBEDDABLE SUBGRAPHSCHIDZEY K.1978; J. AUSTR. MATH. SOC., A; AUS; DA. 1978; VOL. 26; NO 3; PP. 353-367; BIBL. 6 REF.Article

NOTE ON 2-CONNECTED GRAPHS WITH D(U)+D(V) >OU= N-4JUNG HA; NARA C.1982; ARCH. MATH.; ISSN 0003-889X; CHE; DA. 1982; VOL. 39; NO 4; PP. 383-384; BIBL. 3 REF.Article

A realization of graph associahedraDEVADOSS, Satyan L.Discrete mathematics. 2009, Vol 309, Num 1, pp 271-276, issn 0012-365X, 6 p.Article

The sum numbers and the integral sum numbers of the graph K_n+1 \ E(K_1,r)HAIYING WANG.Discrete mathematics. 2009, Vol 309, Num 12, pp 4135-4141, issn 0012-365X, 7 p.Article

A short proof of a theorem on degree sets of graphsTRIPATHI, Amitabha; VIJAY, Sujith.Discrete applied mathematics. 2007, Vol 155, Num 5, pp 670-671, issn 0166-218X, 2 p.Article

The linear arboricity of planar graphs with no short cyclesWU, Jian-Liang; HOU, Jian-Feng; LIU, Gui-Zhen et al.Theoretical computer science. 2007, Vol 381, Num 1-3, pp 230-233, issn 0304-3975, 4 p.Article

Irregularity strength of regular graphs of large degreeAMAR, D.Discrete mathematics. 1993, Vol 114, Num 1-3, pp 9-17, issn 0012-365XConference Paper

Disjoint triangles and quadrilaterals in a graphJIN YAN.Discrete mathematics. 2008, Vol 308, Num 17, pp 3930-3937, issn 0012-365X, 8 p.Article

The reconstruction conjecture and edge idealsDALILI, Kia; FARIDI, Sara; TRAVES, Will et al.Discrete mathematics. 2008, Vol 308, Num 10, pp 2002-2010, issn 0012-365X, 9 p.Article

On the number of independent chorded cycles in a graphFINKEL, Daniel.Discrete mathematics. 2008, Vol 308, Num 22, pp 5265-5268, issn 0012-365X, 4 p.Article

Genus bounds for embeddings with large minimum degree and representativityPLUMMER, Michael D; XIAOYA ZHA.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 167-178, issn 0012-365XConference Paper

A note on large cayley graphs of diameter two and given degreeSIAGIOVA, Jana; SIRAN, Jozef.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 379-382, issn 0012-365X, 4 p.Article

Simply sequentially additive labelings of 2-regular graphsHAJNAL, Péter; NAGY, Gábor.Discrete mathematics. 2010, Vol 310, Num 4, pp 922-928, issn 0012-365X, 7 p.Article

Resolvable packings RMP(3, 2; n, n - 3) and coverings RMC(3,2;n,n - 2)CAO, H.Discrete mathematics. 2006, Vol 306, Num 12, pp 1240-1246, issn 0012-365X, 7 p.Article

Independent triangles covering given vertices of a graphHAO LI; JIANPING LI.Theoretical computer science. 2001, Vol 263, Num 1-2, pp 333-344, issn 0304-3975Article