default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 11
Volume 11, July 2002
- F. Aguiló-Gost:
A C.A.S. treatment of optimal-diameter double-loop digraphs families. 1-11 - Jin Akiyama, Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon. 12-19 - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. 20-29 - Ahmed M. Assaf, H. Alhalees, L. P. S. Singh:
Directed Covering with Block Size 5 and Index Odd. 30-52 - M. Cemil Azizoglu, Ömer Egecioglu:
The Isoperimetric Number and The Bisection Width of Generalized Cylinders. 53-62 - Douglas Bauer
, Hajo Broersma, Edward F. Schmeichel:
More Progress on Tough Graphs - The Y2K Report. 63-80 - Lowell W. Beineke, Robert C. Vandell:
No Cycling in the Graphs! 81-88 - Fred Buckley, Frank Harary:
Unsolved Problems on Distance in Graphs. 89-97 - Pavel Chebotarev, Elena Shamis:
The Forest Metrics for Graph Vertices. 98-107 - Pavel Chebotarev:
Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains. 108-116 - Zhibo Chen:
On Integral Sum Graphs. 117-127 - Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). 128-139 - Eddie Cheng, Marc J. Lipman:
Basic Structures of Some Interconnection Networks. 140-156 - Eddie Cheng, Sven de Vries:
Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes. 157-171 - Dennis Collins:
On the Rationale of the Transformity Method. 172-200 - Patricia Erthal de Moraes, Nair Maria Maia de Abreu, Samuel Jurkiewicz:
The Fifth and Sixth Coefficients of the Characteristic Polynomial of a Graph. 201-208 - Jean E. Dunbar, Marietjie Frick, Frank Bullock:
Path Partitions and Pn-free Sets. 209-217 - Wayne M. Dymàcek, Matthew Koerlin, Jean-Guy Speton, Tom P. Whaley, Jennifer Yanulavich:
Disconnected Complements of Steinhaus graphs. 218-232 - Clifton E. Ealy Jr.:
On the genus of the groups PSL(2, q), PSL(3, q), and PSp(4, q). 233-252 - Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. 253-264 - Bruce S. Elenbogen, John Frederick Fink:
Remarks on Distance Distributions for Graphs Modeling Computer Networks. 265-277 - Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen:
Addressing the Petersen graph. 278-283 - Hiroshi Era, Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
A note on construction of upper bound graphs. 284-291 - Larry Ericksen:
Lacunary Polynomial Sums. 292-298 - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
On the Super Edge-Magic Deficiency of Graphs. 299-314 - Samuel Jurkiewicz, Kelly Elaine Fonseca Freitas, Daniela Fuchs Salomão:
Independent Production of Non Hamiltonian Graphs. 315-321 - Hung-Lin Fu, Ming-Chun Tsai:
The Maximum Genus of a Graph with Given Diameter and Connectivity. 322-329 - Hung-Lin Fu, Ming-Chun Tsai:
The Maximum Genus of a Graph with Given Diameter and Connectivity. 330-337 - Wayne Goddard, Michael A. Henning:
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. 338-348 - Stephen J. Greenfield, Brenda J. Latka:
Embedded antichains in tournaments. 349-357 - John M. Harris, Michael J. Mossinghoff:
Traceability in Small Claw-Free Graphs. 358-364 - Katherine Humphreys, Heinrich Niederhausen:
Counting Lattice Paths with an Infinite Step Set and Special Access. 365-375 - Tao Jiang, Douglas B. West:
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees. 376-385 - Stanislav Jendrol', Heinz-Jürgen Voss:
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree. 386-409 - Garry L. Johns:
A Sharp Bound for the Marginal Appendage Number. 410-416 - Peter D. Johnson Jr., Christopher A. Rodger:
Coloring the Vertices of a Graph With Measurable Sets in a Probability Space. 417-424 - Dawn M. Jones, Arthur T. White:
On the Genus of a Subfield of a Field. 425-429 - Paul C. Kainen:
On robust cycle bases. 430-437 - Walter W. Kirchherr:
Graph Operations and Zipfian Degree Distributions. 438-442 - Wai Chee Shiu, Peter C. B. Lam, Sin-Min Lee:
Edge-magic Indices of (n, n - 1)-graphs. 443-458 - Agung Lukito, A. J. van Zanten:
Vertex Partitions of Hypercubes into Symmetric Snakes. 459-467 - Rong Luo, Cun-Quan Zhang:
Total chromatic number of graphs with small genus. 468-477 - Terry A. McKee:
A Characteristic Approach to Bipartite Graphs and Incidence Graphs. 478-484 - Peter Mihók:
On the existence of uniquely partitionable graphs. 485-490 - John Mitchem, Edward F. Schmeichel:
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees. 491-502 - David Morgan:
All Lobsters with Perfect Matchings are Graceful. 503-508 - Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces. 509-518 - Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe:
On 3-coloring of plane triangulations. 519-524 - Masataka Nakamura:
Excluded-Minor Characterizations of Antimatroids arisen from Posets and Graph Searches. 525-541 - Radhika Ramamurthi, Douglas B. West:
Maximum Face-Constrained Coloring of Plane Graphs. 542-549 - Toshinori Sakai:
Long Paths Through Specified Vertices In 3-Connected Graphs. 550-561 - Stefan Porubský, Johanan Schönheim:
New necessary and sufficient conditions on (ai, mi) in order that x = ai (mod mi) be a covering system. 562-566 - Shahriar Shahriari:
Width and f-vectors of Cutsets in the Truncated Boolean Lattice. 567-579 - Stephen E. Shauger:
Graphs Having (2 mod d)-Cycles. 580-594 - M. M. Shikare:
Splitting Operation and Connectedness in Binary Matroids. 595-607 - Kazuhiko Ushio:
Evenly partite star-factorization of symmetric complete tripartite multi-digraphs. 608-611 - Robert C. Vandell:
Maximum Arc-integrity of Tournaments and Bipartite Tournaments. 612-619 - Ian Walters:
Constructing Cospectral Digraphs with Arbitrary Centers. 620-625 - John J. Watkins, Christopher Ricci:
Kings Domination on a Torus. 626-631 - Arthur T. White:
Modelling 3-configurations on Surfaces. 632-646 - Janez Zerovnik:
Chromatic numbers of the strong product of odd cycles. 647-652 - Agnes V. Dizon-Garciano, Ian June L. Garces, Mari-Jo P. Ruiz:
On Perfect Cayley Graphs. 653-680 - Heather Gavlas, Kelly Schultz:
Efficient Open Domination. 681-691 - Konstantinos Kokkinos, Dionysios Kountanis:
Properties of Regular Uniform k - Stratified Graphs. 692-704 - John Gimbel, Jaroslav Nesetril:
Partitions of Graphs into Cographs. 705-721 - Baoguang Xu, Jianfang Wang:
On the Hamiltonian cycle Decompositions of Complete 3-Uniform Hypergraphs. 722-733 - Sugi Guritman, Juriaan Simonis:
Restrictions on the weight distribution of quaternary linear codes. 734-741 - Ruth Haas, Thomas B. Wexler:
Bounds on the signed domination number of a graph. 742-750 - David C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager:
The Domination Number of Cubic Graphs with Girth at least Five. 751-759 - Katsuhiro Ota:
On minimally 3-connected graphs on a surface. 760 - Yousef Alavi, Dawn Jones, Don R. Lick, Jiuqiang Liu:
Preface: Volume 11. 761-762
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-08-04 11:58 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.
