Locally symmetric graphs of prescribed Girth and Coxeter groupsLUBOTZKY, A.SIAM journal on discrete mathematics. 1990, Vol 3, Num 2, pp 277-280, 4 p.Article

Maximum non-path-connected graphsHENDRY, G. R. T.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 294-298, issn 0095-8956Article

Enumeration of connected invariant graphsBENDER, E. A; RODNEY CANFIELD, E.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 268-278, issn 0095-8956Article

Proof of the squashed cube conjectureWINKLER, P. M.Combinatorica (Print). 1983, Vol 3, Num 1, pp 135-139, issn 0209-9683Article

Connected, locally 2-connected, K_1,3-free graphs are panconnectedKANETKAR, S. V; RAO, P. R.Journal of graph theory. 1984, Vol 8, Num 3, pp 347-353, issn 0364-9024Article

The multiplicity of 1-factors in the square of a graphHENDRY, G. R. T.Journal of graph theory. 1984, Vol 8, Num 3, pp 399-403, issn 0364-9024Article

Trivially noncontractible edges in a contraction critically 5-connected graphANDO, Kiyoshi.Discrete mathematics. 2005, Vol 293, Num 1-3, pp 61-72, issn 0012-365X, 12 p.Conference Paper

The interval function of a connected graph and road systemsNEBESKY, Ladislav.Discrete mathematics. 2007, Vol 307, Num 16, pp 2067-2073, issn 0012-365X, 7 p.Article

Contractible edges in minimally k-connected graphsANDO, Kiyoshi; KANEKO, Atsushi; KAWARABAYASHI, Ken-Ichi et al.Discrete mathematics. 2008, Vol 308, Num 4, pp 597-602, issn 0012-365X, 6 p.Article

The smallest number of edges in a 2-connected graph with specified diameterBELOTSERKOVSKY, D.Discrete mathematics. 2007, Vol 307, Num 19-20, pp 2376-2384, issn 0012-365X, 9 p.Article

Packings by cliques and by finite families of graphsHELL, P; KIRKPATRICK, D. G.Discrete mathematics. 1984, Vol 49, Num 1, pp 45-59, issn 0012-365XArticle

Chromatic polynomials of connected graphsCHONG-YUN CHAO; LIAN-CHANG ZHAO.Archiv der Mathematik. 1984, Vol 43, Num 2, pp 187-192, issn 0003-889XArticle

Even edge colorings of a graphACHARYA, B. D.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 1, pp 78-79, issn 0095-8956Article

Sur le problème minimum d'arcs à inverser pour rendre un graphe fortement connexe: application à un problème de trafic = On the number of minimum arcs to invert for obtain a connected strongly graph: application for traffic problemBERGE, C.Cahiers du Centre d'études de recherche opérationnelle. 1983, Vol 25, Num 3-4, pp 183-186, issn 0008-9737Article

Edge Number of 3-Connected Diameter 3 GraphsTSAI, Mine-Chun; FU, Hung-Lin.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 364-367, isbn 0-7695-2135-5, 1Vol, 4 p.Conference Paper

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

A note on counting connected graph covering projectionsHOFMEISTER, M.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 286-292, issn 0895-4801Article

Cycle-regular graphsMOLLARD, M.Discrete mathematics. 1991, Vol 89, Num 1, pp 29-41, issn 0012-365XArticle

A local characterization of the Jonhson schemeHALL, J. I.Combinatorica (Print). 1987, Vol 7, Num 1, pp 77-85, issn 0209-9683Article

Even graphsGOBEL, F; VELDMAN, H. J.Journal of graph theory. 1986, Vol 10, Num 2, pp 225-239, issn 0364-9024Article

On graphs with a fixed number of negative eigenvaluesTORGASEV, A.Discrete mathematics. 1985, Vol 57, Num 3, pp 311-317, issn 0012-365XArticle

Rank 4 groups with a 3-transitive suborbitPERKEL, M.Journal of combinatorial theory. Series A. 1985, Vol 39, Num 2, pp 226-240, issn 0097-3165Article

Cycle games and cycle cut gamesKANO, M.Combinatorica (Print). 1983, Vol 3, Num 2, pp 201-206, issn 0209-9683Article

Some notes on domination edge critical graphsNADER JAFARI RAD; SAYYED HEIDAR JAFARI.Comptes rendus. Mathématique. 2011, Vol 349, Num 9-10, pp 485-488, issn 1631-073X, 4 p.Article

Page / 79