Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Journal of Graph Theory and Applications, Volume 1
Volume 1, Number 1, 2013
- Binlong Li, Hajo Broersma
, Shenggui Zhang:
Forbidden subgraph pairs for traceability of block-chains. 1-10 - Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
The Manhattan product of digraphs. 11-27 - Martin Baca, Ljiljana Brankovic, Marcela Lascsáková, Oudone Phanalasy, Andrea Semanicová-Fenovcíková:
On d-antimagic labelings of plane graphs. 28-39 - Peter Burcsi, Dániel T. Nagy:
The method of double chains for largest families with excluded subposets. 40-49 - Hongliang Lu, Yuqing Lin:
Note on parity factors of regular graphs. 50-55 - Ayesha Shabbir, Carol T. Zamfirescu, Tudor I. Zamfirescu:
Intersecting longest paths and longest cycles: A survey. 56-76
Volume 1, Number 2, 2013
- Maria Timkova:
Enforced hamiltonian cycles in generalized dodecahedra. 77-88 - Michalis Christou, Costas S. Iliopoulos, Mirka Miller:
Bipartite Ramsey numbers involving stars, stripes and trees. 89-99 - Ali Ahmad, Martin Baca, Muhammad Numan:
On irregularity strength of disjoint union of friendship graphs. 100-108 - Edy Tri Baskoro, Asmiati:
Characterizing all trees with locating-chromatic number 3. 109-117 - Charles Delorme:
Sequence of maximal distance codes in graphs or other metric spaces. 118-124 - Jemal H. Abawajy, Andrei V. Kelarev, Morshed U. Chowdhury:
Power graphs: A survey. 125-147
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-04-22 20:02 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:
