default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 297
Volume 297, Numbers 1-3, 28 July 2005
- Antonio Avilés
:
Extensions of Boolean isometries. 1-12 - Richard C. Brewster, Renato Dedic, François Huard, Jeffery Queen:
The recognition of bound quivers using edge-coloured homomorphisms. 13-25 - José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas:
Rebuilding convex sets in graphs. 26-37 - Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi:
Embedding path designs into kite systems. 38-48 - Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec:
Counting embeddings of a chain into a tree. 49-59 - James G. Lefevre, Mary Waterhouse:
Some equitably 3-colourable cycle decompositions of complete equipartite graphs. 60-77 - Hajime Matsumura:
Vertex-disjoint 4-cycles containing specified edges in a bipartite graph. 78-90 - Yossi Moshe:
The distribution of elements in automatic double sequences. 91-103 - Kah Loon Ng, Khee Meng Koh:
On optimal orientation of cycle vertex multiplications. 104-118 - Primoz Potocnik, Martin Skoviera, Riste Skrekovski:
Nowhere-zero 3-flows in abelian Cayley graphs. 119-127 - Ligong Wang, Xueliang Li:
Integral trees with diameters 5 and 6. 128-143
- Thomas Andreae:
Reconstructing the number of blocks of an infinite graph. 144-151 - Yehuda Ashkenazi:
C3 saturated graphs. 152-158 - Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Reconstructing subgraph-counting graph polynomials of increasing families of graphs. 159-166 - Mohammed M. M. Jaradat:
On the Anderson-Lipman conjecture and some related problems. 167-173 - Hyun Kwang Kim, Dong Yeol Oh:
On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure. 174-181 - Terry A. McKee:
Requiring chords in cycles. 182-189 - Gábor N. Sárközy, Stanley M. Selkow:
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós. 190-195 - Svetoslav Savchev, Fang Chen:
Kemnitz' conjecture revisited. 196-201 - Galen E. Turner III:
A generalization of Dirac's theorem: Subdivisions of wheels. 202-205 - Li Zhang, Baoyindureng Wu:
A note on 3-choosability of planar graphs without certain cycles. 206-209
- Philip A. Sinclair:
Erratum to "On removable even circuits in graphs". 210-213
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 2025-10-30 00:57 CET 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:
