default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 151
Volume 151, Numbers 1-3, May 1996
- Norman F. Quimpo, Mari-Jo P. Ruiz:
Preface. 1-2 - Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On mixed ramsey numbers. 3-13 - Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia:
On circles containing the maximum number of points. 15-18 - Brian Alspach, C. C. Chen, Kevin McAvaney:
On a class of Hamiltonian laceable 3-regular graphs. 19-38 - Kiyoshi Ando, Atsushi Kaneko:
A remark on the connectivity of the complement of a 3-connected graph. 39-47 - Esperanza Blancaflor Arugay, Severino Villanueva Gervacio:
On path-chromatically unique graphs. 49-53 - Jose Maria P. Balmaceda
:
A note on multiplicity-free permutation characters. 55-58 - Claude Berge:
Combinatorial games on a graph. 59-65 - Jose M. Bernaldez:
On k-complementing permutations of cyclically k-complementary graphs. 67-70 - Chai-Ling Deng, Chong-Keang Lim:
A characterization of graphs G with G~K2(G). 71-79 - Ding-Zhu Du, D. Frank Hsu, Yuh-Dauh Lyuu:
On the diameter vulnerability of Kautz digraphs. 81-85 - Yoshimi Egawa, Mikio Kano:
Sufficient conditions for graphs to have (g, f)-factors. 87-90 - Severino Villanueva Gervacio:
Trees with diameter less than 5 and non-singular complement. 91-97 - Kiyoshi Hosono, Masatsugu Urabe, Mamoru Watanabe:
Topics on line segments and polygons. 99-104 - Noboru Ito:
Even tournaments and Hadamard tournaments. 105-111 - Mikio Kano:
Edge-removing games of star type. 113-119 - Khee Meng Koh, K. S. Poh:
On the lower length of the closed-set lattice of a tree. 121-130 - Monique Laurent:
Graphic vertices of the metric polytope. 131-153 - Ko-Wei Lih, Pou-Lin Wu:
On equitable coloring of bipartite graphs. 155-160 - Chong-Keang Lim, Kah Seng Lam:
The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem. 161-167 - John W. Moon:
On the total distance between nodes in tournaments. 169-174 - Christine M. O'Keefe:
Ovoids in PG(3, q): a survey. 175-188 - Christine M. O'Keefe, Arlene A. Pascasio:
Images of conics under derivation. 189-199 - Cheryl E. Praeger, Blessilda P. Raposa:
Non-symmetric nearly triply regular designs. 201-212 - Helen M. Rara:
Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids. 213-219 - Sze-Chin Shee, Yong-Song Ho:
The cordiality of the path-union of n copies of a graph. 221-229 - Ngo Dac Tan:
On the isomorphism problem for a family of cubic metacirculant graphs. 231-242
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-15 00:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
