Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 333
Volume 333, October 2014
- Mikio Kano, Masao Tsugaki
, Guiying Yan:
m-dominating k-ended trees of graphs. 1-5 - Hong Zhu, Zhengke Miao:
On strong list edge coloring of subcubic graphs. 6-13 - Yandong Bai, Hao Li, Weihua He:
Complementary cycles in regular bipartite tournaments. 14-27 - Sandi Klavzar, Mohammad J. Nadjafi-Arani:
On the difference between the revised Szeged index and the Wiener index. 28-34 - Thomas Enkosky, Branden Stone:
A sequence defined by M-sequences. 35-38 - Charles R. Johnson, Andrew A. Li, Andrew J. Walker:
Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree. 39-55 - Michitaka Furuya:
Forbidden subgraphs and the existence of a 2-walk. 56-61 - Peter Borg:
A short proof of an Erdős-Ko-Rado theorem for compositions. 62-65 - Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for the circumference of 4-connected graphs. 66-83 - Andrea Blanchard, Ehrich Pakala, Marius Somodi:
Ihara zeta functions and cospectrality of joins of regular graphs. 84-93 - Mindaugas Bloznelis, Katarzyna Rybarczyk:
k-connectivity of uniform s-intersection graphs. 94-100 - Ilkyoo Choi, Haihui Zhang:
Vertex arboricity of toroidal graphs with a forbidden cycle. 101-105 - Sukumar Das Adhikari, Yong-Gao Chen:
On monochromatic configurations for finite colorings. 106-109 - Fan Yang, Xiangwen Li, Hong-Jian Lai:
Realizing degree sequences as Z3-connected graphs. 110-119
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-07-04 21:18 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:
