设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(1)
Springer电子图书(6)
CNKI会议论文(1)
CNKI学位论文(1008)
知网期刊论文(460)
在“
Elsevier电子期刊
”中,
命中:
1,095
条,耗时:0.018989 秒
在所有数据库中总计命中:
1,476
条
1.
10-tough chordal
graph
s are
Hamiltonian
作者:
Adam Kabela
a
;
kabela@kma.zcu.cz
;
Tomá
;
&scaron
;
Kaiser
b
;
kaisert@kma.zcu.cz
关键词:
Toughness
;
Hamilton cycle
;
Chordal
graph
;
Hamilton-connected
graph
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
2.
Monotone drawings of
graph
s with few directions
作者:
Patrizio Angelini
angelini@informatik.uni-tuebingen.de
关键词:
Monotone drawings
;
Schnyder woods
;
Graph
algorithms
;
Maximal planar
graph
s
;
Hamiltonian
graph
s
刊名:Information Processing Letters
出版年:2017
3.
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free
graph
s
作者:
Zhi-Hong Chen
a
;
1
;
chen@butler.edu
;
Hong-Jian Lai
b
;
Liming Xiong
c
;
2
关键词:
Claw-free
graph
;
Hamiltonian
cycle
;
Minimum degree condition
;
Ryjá
;
ček's closure concept
;
Catlin's reduction method
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
4.
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected
graph
作者:
Insung Ihm
a
;
ihm@sogang.ac.kr
;
Jung-Heum Park
b
;
j.h.park@catholic.ac.kr
关键词:
Disjoint path cover
;
Cube of
graph
;
Hamiltonian
path
;
Spanning tree
;
Unicyclic
graph
;
Linear-time algorithm
刊名:Discrete Applied Mathematics
出版年:2017
5.
On longest non-
Hamiltonian
cycles in di
graph
s with the conditions of Bang-Jensen, Gutin and Li
作者:
S.Kh. Darbinyan
;
samdarbin@ipia.sci.am
;
I.A. Karapetyan
isko@ipia.sci.am
关键词:
Di
graph
s
;
Cycles
;
Hamiltonian
cycles
;
Longest non-
Hamiltonian
cycles
刊名:Discrete Applied Mathematics
出版年:2017
6.
Automorphism groups of Cayley
graph
s generated by block transpositions and regular Cayley maps
作者:
Annachiara Korchmaros
a
;
akorchmaros3@gatech.edu" class="auth_mail" title="E-mail the corresponding author
;
Istvá
;
n Ková
;
cs
b
;
istvan.kovacs@upr.si" class="auth_mail" title="E-mail the corresponding author
关键词:
Cayley
graph
;
Symmetric group
;
Block transposition
;
Graph
automorphism
;
Cayley map
;
Regular map
刊名:Discrete Mathematics
出版年:2017
7.
Quantum half-adder Boolean logic gate with a nano-
graph
ene molecule and
graph
ene nano-electrodes
作者:
Saurabh Srivastava
a
;
SRIVASTAVA.Saurabh@nims.go.jp
;
Hiori Kino
a
;
Christian Joachim
b
;
a
;
christian.joachim@cemes.fr
关键词:
Graph
ene
;
Logic gates
;
Quantum transport
;
Quantum computing
;
Molecular electronics
;
Half-adder
刊名:Chemical Physics Letters
出版年:2017
8.
Monochromatic connecting colorings in strongly connected oriented
graph
s
作者:
Diego Gonzá
;
lez-Moreno
a
;
dgonzalez@correo.cua.uam.mx
;
Mucuy-kak Guevara
b
;
mucuy-kak.guevara@ciencias.unam.mx
;
Juan José
;
Montellano-Ballesteros
c
;
juancho@math.unam.mx
关键词:
Monochromatic
;
Strong connectivity
;
Coloring
;
Oriented
graph
刊名:Discrete Mathematics
出版年:2017
9.
Embedding the Erdős-Rényi hyper
graph
into the random regular hyper
graph
and Hamiltonicity
作者:
Andrzej Dudek
a
;
1
;
5
;
Alan Frieze
b
;
2
;
Andrzej Ruciński
c
;
3
;
5
;
Matas &Scaron
;
ileikis
d
;
4
;
5
;
matas.sileikis@gmail.com
关键词:
Random regular
graph
;
Random hyper
graph
;
Hamilton cycle
;
Monotone
graph
property
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
10.
Implicit degree condition for hamiltonicity of 2-heavy
graph
s
作者:
Xing Huang
bitmathhuangxing@163.com
关键词:
Implicit degree
;
Hamilton cycle
;
f-implicit-heavy
;
2-heavy
刊名:Discrete Applied Mathematics
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(1095)
题名(223)
关键词(317)
文摘(898)
按出版年细分(1095)
2027年及以后(39)
2017年(15)
2016年(43)
2015年(13)
2014年(1)
2013年(66)
2012年(69)
2011年(68)
2010年(56)
2009年(95)
2008年(86)
2007年(58)
2006年(40)
2005年(44)
2004年(49)
2003年(36)
2002年(47)
2001年(44)
2000年(33)
2000年及以前(193)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.