Filters








14 Hits in 3.1 sec

Page 6605 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
Daniel Ashlock (1-1ASU; Ames, IA) 97k:05148 05C65 Jacobson, Michael S. (1-LSVL; Louisville, KY); Kézdy, André E. (1-LSVL; Louisville, KY); Lehel, Jen6é (H-AOS-C; Budapest) Intersection graphs associated  ...  VSCP, e.g.: (i) there exists an optimal solution (x, y, z) to the linear relaxation (1)-(4) satisfying the property x;, y,,z,- € {0,1/2,1},iEV,reET, e € E and such a solution can be found in O(max{|V|  ... 

Page 6771 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
Then there exists a self- complementary vertex-transitive graph of order n if and only if p=1 (mod 4), g=1 (mod 4). This is a negative solution of a problem of the reviewer [Math.  ...  Zelinka (Liberec) 98k:05118 05C75 0sC65 Jacobson, Michael S. (1-LSVL; Louisville, KY); Kézdy, André E. (1-LSVL; Louisville, KY); Lehel, Jené (H-AOS-C; Budapest) Recognizing intersection graphs of linear  ... 

Page 7773 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
Jacobson, André E. Kézdy and Jen6 Lehel, Odd cycles and ©-cycles in hypergraphs (96-98); Y. O. Hamidoune, A. S. Llado and O.  ...  Goldwasser, The maximum upper density of a set of positive real numbers with no solutions to x 4 y = kz (54-56); Michael Drmota, The parity of the sum-of-digits function of multiples of primes (57); Artiiras  ... 

Page 179 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
., 98g:05139 Kamidoi, Yoko (with Wakabayashi, Shinichi) A divide and conquer approach to the minimum k -way cut problem.  ...  Maximization versions of “lights out” games in grids and graphs. (English summary) 98)j:05119 An algorithm to find the core of a CV- 05C Graph theory 05C85 Grable, David A.  ... 

Page 146 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
., 99g:68018 Luo, Xin Mi Optimal solutions of a class of integer programming problems and the girth of circulant digraphs. (Chinese.  ...  (English summary) 99d:05057 Jacobson, Michael S. (with Kézdy, André E.; Lehel, Jen) Scenic graphs. I. Traceable graphs.  ... 

Page 868 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
Galbraith) 2002h:14039 14G50 (11G20, 11Y16) Jacobson, Michael S. (with Gyarfas, Andras; Kézdy, André E.; Lehel, Jené) Odd cycles and ©-cycles in hypergraphs.  ...  Solutions of a system of partial qg-difference equations modulo-g and an analogue of Beltrami’s system. (English summary) Ganita 51 (2000), no. 2, 117-126. (Dharma P.  ... 

Page 163 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
) 2002h:05100 Gyarfas, Andras (with Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenéd) Odd cycles and ©-cycles in hypergraphs.  ...  ., 2002i:05068 Gutin, Gregory (with Yeo, Anders) Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs (English summary  ... 

Page 1391 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
A novel technique for the solution of second-order difference equations. (English summary) /EEE Trans. Antennas and Propagation 49 (2001), no. 12, 1612-1617.  ...  Math. 24 (1996), no. 1, 109-112. 32A05 (32A15) Lehel, Jené (with Gould, Ronald J.; Jacobson, Michael S.) Potentially G-graphical degree sequences.  ... 

Page 1601 of Mathematical Reviews Vol. 28, Issue Index [page]

Mathematical Reviews  
(Summary) 96h:05161 05C75 — (with Jacobson, Michael S.; Kézdy, André E.; Kubicka, Ewa; Kubicki, Grzegorz; Lehel, Jen6; Wang, Chi) The path spectrum of a graph.  ...  Enns) 96c:05008 05A17 (05C38) — (with Jacobson, Michael S.; Kézdy, André E.) The 2-intersection number of paths and bounded-degree trees. (English summary) J. Graph Theory 19 (1995), no. 4, 461-469.  ... 

Page 727 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(Armengol Gasull) 2002f:14083 14R15 (14P99, 26B10) Gyarfas, Andras (with Jacobson, Michael S.; Kézdy, André E.; Lehel, Jené) Odd cycles and ©-cycles in hypergraphs.  ...  (see 2002i:62005) 62B10 (65R20) — Inverse problem for the acoustic wave equation: a probabilistic approach to approxi- mations and uniqueness. (English summary) App!/. Math.  ... 

Advances on the Hamiltonian Problem - A Survey

Ronald J. Gould
2003 Graphs and Combinatorics  
For completeness of the presentation of both particular questions and the general area, it also contains material on closely related topics such as traceable, pancyclic and hamiltonian-connected graphs  ...  This article is intended as a survey, updating earlier surveys in the area.  ...  However, an upper bound was provided by Chen, Jacobson, Kézdy and Lehel in [75] , which still leaves a considerable gap for further investigation.  ... 
doi:10.1007/s00373-002-0492-x fatcat:7isvoy4l6jfxxmeftkdcwoyhoy

Page 2012 of Mathematical Reviews Vol. 32, Issue Index [page]

Mathematical Reviews  
(Summary) 2000g:37137 37L60 (37D45, 37E99, 37K60) Wang, Chi (with Chen, Guantao; Jacobson, Michael S.; Kézdy, André E.; Lehel, Jen6; Scheinerman, Edward R.)  ...  English and Chinese summaries) J. Syst. Eng. 14 (1999), no. 4, 345-350. 90B35 Wang, Chengwen Upper and lower solutions methods for existence of periodic solutions of Duffing equation.  ... 

A Dynamic Survey of Graph Labeling

Joseph Gallian
2011 the electronic journal of combinatorics   unpublished
For the convenience of the reader the survey includes a detailed table of contents and index.  ...  A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s.  ...  Irregular Total Labelings Motivated by the notion of the irregularity strength of a graph introduced by Chartrand, Jacobson, Lehel, Oellermann, Ruiz, and Saba [302] in 1988 and various kinds of other  ... 
fatcat:h57wnjzhinhspnkupd6phq224q

A Dynamic Survey of Graph Labeling

Joseph Gallian
2010 the electronic journal of combinatorics   unpublished
For the convenience of the reader the survey includes a detailed table of contents and index.  ...  A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s.  ...  Irregular Total Labelings Motivated by the notion of the irregularity strength of a graph introduced by Chartrand, Jacobson, Lehel, Oellermann, Ruiz, and Saba [276] in 1988 and various kinds of other  ... 
fatcat:upiigvsftncjhb43eaevp2wzxy