kw.\*:("Simple graph")
Results 1 to 25 of 28
Selection :
Perfect path double covers in every simple graphHAO LI.Journal of graph theory. 1990, Vol 14, Num 6, pp 645-650, issn 0364-9024, 6 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
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
A characterization of unimodular orientations of simple graphsBOUCHET, A.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 1, pp 45-54, issn 0095-8956Article
Inversion of e-simple block matricesFIEDLER, Miroslav.Linear algebra and its applications. 2005, Vol 400, pp 231-241, issn 0024-3795, 11 p.Article
On the adjacent vertex distinguishing total coloring numbers of graphs with A = 3XIANG'EN CHEN.Discrete mathematics. 2008, Vol 308, Num 17, pp 4003-4007, issn 0012-365X, 5 p.Article
Testing bandwidth k for k-connected graphsENGEL, Konrad; GUTTMANN, Sven.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 2, pp 301-312, issn 0895-4801, 12 p.Article
Counting representable sets on simple graphsJEAVONS, P. G.Discrete applied mathematics. 1993, Vol 47, Num 1, pp 33-46, issn 0166-218XArticle
Degree sums and subpancyclicity in line graphsLIMING XIONG; BROERSMA, H. J; HOEDE, C et al.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 255-267, issn 0012-365XArticle
Optimal pebbling of graphsMUNTZ, Jessica; NARAYAN, Sivaram; STREIB, Noah et al.Discrete mathematics. 2007, Vol 307, Num 17-18, pp 2315-2321, issn 0012-365X, 7 p.Article
On the domination number of a graphPRUCHNEWSKI, Anja.Discrete mathematics. 2002, Vol 251, Num 1-3, pp 129-136, issn 0012-365XConference Paper
On σ-polynomials and a class of chromatically unique graphsQINGYAN DU.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 153-165, issn 0012-365XArticle
The L(2, 1)-labeling of Ki,n-free graphs and its applicationsZHENDONG SHAO; YEH, Roger K; KIN KEUNG POON et al.Applied mathematics letters. 2008, Vol 21, Num 11, pp 1188-1193, issn 0893-9659, 6 p.Article
Undirected simple connected graphs with minimum number of spanning treesBOGDANOWICZ, Zbigniew R.Discrete mathematics. 2009, Vol 309, Num 10, pp 3074-3082, issn 0012-365X, 9 p.Article
Implementing molecular connectivity theory, a basic tool in modeling drugsPOGLIANI, Lionello.Journal of pharmaceutical sciences. 2007, Vol 96, Num 8, pp 1856-1871, issn 0022-3549, 16 p.Article
A linear-programming approach to the generalized Randic indexFISCHERMANN, Miranca; HOFFMANN, Arne; RAUTENBACH, Dieter et al.Discrete applied mathematics. 2003, Vol 128, Num 2-3, pp 375-385, issn 0166-218X, 11 p.Article
A combinatorial construction for simply-laced Lie algebrasWILDBERGER, N. J.Advances in applied mathematics (Print). 2003, Vol 30, Num 1-2, pp 385-396, issn 0196-8858, 12 p.Conference Paper
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1OPATRNY, J; SOTTEAU, D.Discrete applied mathematics. 2000, Vol 98, Num 3, pp 237-254, issn 0166-218XArticle
Enumeration of m-ary cactiBONA, M; BOUSQUET, M; LABELLE, G et al.Advances in applied mathematics (Print). 2000, Vol 24, Num 1, pp 22-56, issn 0196-8858Article
The complexity of harmonious colouring for treesEDWARDS, K; MCDIARMID, C.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 133-144, issn 0166-218XConference Paper
Three-colourability and forbidden subgraphs. II: polynomial algorithmsRANDERATH, Bert; SCHIERMEYER, Ingo; TEWES, Meike et al.Discrete mathematics. 2002, Vol 251, Num 1-3, pp 137-153, issn 0012-365XConference Paper
Vertex-magic total labelings of generalized Petersen graphsBACA, Martin; MILLER, Mirka; SLAMIN et al.International journal of computer mathematics. 2002, Vol 79, Num 12, pp 1259-1263, issn 0020-7160, 5 p.Conference Paper
Automata-based representations for infinite graphsLA TORRE, Salvatore; NAPOLI, Margherita.Theoretical informatics and applications. 2001, Vol 35, Num 4, pp 311-330Article
A polynomial algorithm for finding T-span of generalized cactiGIARO, Krzysztof; JANCZEWSKI, Robert; MAŁAFIEJSKI, Michał et al.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 371-382, issn 0166-218X, 12 p.Article
On the domination search numberFOMIN, Fedor V; KRATSCH, Dieter; MÜLLER, Haiko et al.Discrete applied mathematics. 2003, Vol 127, Num 3, pp 565-580, issn 0166-218X, 16 p.Article
