Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 23
Volume 23, Number 1, 2003
- Stefan Berezný, Vladimír Lacko:
Balanced problems on graphs with categorization of edges. 5-21 - Beata Orchel:
2-placement of (p, q)-trees. 23-36 - Damir Vukicevic:
Decomposition of complete graphs into factors of diameter two and three. 37-54 - Martin Sonntag:
Difference labelling of cacti. 55-65 - Martin Baca, François Bertault, James Arthur MacDougall, Mirka Miller, Rinovia Simanjuntak, Slamin:
Vertex-antimagic total labelings of graphs. 67-83 - Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
On cyclically embeddable (n, n)-graphs. 85-104 - Christian Germain, Hamamache Kheddouci:
On the packing of two copies of a caterpillar in its third power. 105-115 - Amelie J. Berger, Peter Mihók:
Prime ideals in the lattice of additive induced-hereditary graph properties. 117-127 - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
Labeling the vertex amalgamation of graphs. 129-139 - Ralph J. Faudree, Annette Schelten, Ingo Schiermeyer:
The Ramsey number r(C7, C7, C7). 141-158 - Igor E. Zverovich:
Perfect connected-dominant graphs. 159-162 - Christina M. Mynhardt
:
Upper bounds for the domination numbers of toroidal queens graphs. 163-175 - Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees: cases 0 and 1 mod 12. 177-187 - Yair Caro, Michael S. Jacobson:
On non-z(mod k) dominating sets. 189-199
Volume 23, Number 2, 2003
- Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik:
Preface. 205 - Claude Benzaken, Sylvain Gravier, Riste Skrekovski:
Hajós' theorem for list colorings of hypergraphs. 207-213 - Bostjan Bresar:
Arboreal structure and regular graphs of median-like classes. 215-225 - Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Tree-like isometric subgraphs of hypercubes. 227-240 - Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Circuit bases of strongly connected digraphs. 241-260 - Bert L. Hartnell, Douglas F. Rall:
Improving some bounds for dominating Cartesian products. 261-272 - Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
Weak k-reconstruction of Cartesian products. 273-285 - Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis:
On constant-weight TSP-tours. 287-307 - Henry Martyn Mulder, Ladislav Nebesky:
Modular and median signpost systems and their underlying graphs. 309-324 - Jaroslav Nesetril, Claude Tardif:
On maximal finite antichains in the homomorphism order of directed graphs. 325-332 - Michael D. Plummer, Michael Stiebitz, Bjarne Toft:
On a special case of Hadwiger's conjecture. 333-363 - Norbert Polat:
On dually compact closed classes of graphs and BFS-constructible graphs. 365-381 - Vladimir Ivanovich Trofimov:
Undirected and directed graphs with near polynomial growth. 383-391
a service of 
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 2024-05-08 21:40 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
