设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Elsevier电子期刊(328)
在“
Elsevier电子期刊
”中,
命中:
328
条,耗时:小于0.01 秒
在所有数据库中总计命中:
328
条
1.
The number of colorings of planar graphs with no separating triangles
作者:
Carsten
Thomassen
1
;
ctho@dtu.dk
关键词:
Chromatic polynomial
;
Planar triangulations
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
2.
When does the list-coloring function of a graph equal its chromatic polynomial
作者:
Wei Wang
a
;
b
;
Jianguo Qian
a
;
jgqian@xmu.edu.cn
;
Zhidan Yan
b
关键词:
List coloring
;
Broken cycle
;
Chromatic polynomial
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
3.
Decomposing highly edge-connected graphs into paths of any given length
作者:
F. Botler
fbotler@ime.usp.br
;
G.O. Mota
mota@ime.usp.br
;
M.T.I. Oshiro
oshiro@ime.usp.br
;
Y. Wakabayashi
yw@ime.usp.br
关键词:
Path
;
Decomposition
;
Connectivity
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
4.
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
作者:
Martin Merker
marmer@dtu.dk
关键词:
Edge-decomposition
;
Trees
;
Edge-connectivity
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
5.
Counting and packing Hamilton cycles in dense graphs and oriented graphs
作者:
Asaf Ferber
a
;
asaf.ferber@yale.edu
;
Michael Krivelevich
b
;
1
;
krivelev@post.tau.ac.il
;
Benny Sudakov
c
;
2
;
benjamin.sudakov@math.ethz.ch
关键词:
Hamilton cycles
;
Oriented graphs
;
Packing
;
Counting
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
6.
The prevalence, genetic diversity and antibiotic resistance of Staphylococcus aureus in milk, whey, and cheese from artisan farm dairies
作者:
Lisbeth Mehli
;
lisbeth.mehli@ntnu.no
;
Sunniva Hoel
;
Gunn Merethe Bjø
;
rge
Thomassen
;
Anita Nordeng Jakobsen
;
Hanne Karlsen
刊名:International Dairy Journal
出版年:2017
7.
Decomposing graphs into a constant number of locally irregular subgraphs
作者:
Julien Bensmail
julien.bensmail.phd@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Martin Merker
martin.merker@uni-hamburg.de" class="auth_mail" title="E-mail the corresponding author
;
Carsten
Thomassen
ctho@dtu.dk" class="auth_mail" title="E-mail the corresponding author
刊名:European Journal of Combinatorics
出版年:2017
8.
Non-separating subgraphs in highly connected graphs
作者:
Shinya Fujita
a
;
shinyaa@mti.biglobe.ne.jp" class="auth_mail" title="E-mail the corresponding author
;
Ken-ichi Kawarabayashi
b
;
k_keniti@nii.ac.jp" class="auth_mail" title="E-mail the corresponding author
关键词:
Decomposition
;
Highly connected subgraph
;
Contractible edges
;
Non-separating induced cycle
;
Triangles
;
Cycles
刊名:Journal of Combinatorial Theory, Series B
出版年:2016
9.
Vertex-disjoint cycles in bipartite tournaments
作者:
Diego Gonzá
;
lez-Moreno
a
;
1
;
dgonzalez@correo.cua.uam.mx" class="auth_mail" title="E-mail the corresponding author
;
Camino Balbuena
b
;
m.camino.balbuena@upc.edu" class="auth_mail" title="E-mail the corresponding author
;
Mika Olsen
a
;
olsen@correo.cua.uam.mx" class="auth_mail" title="E-mail the corresponding author
关键词:
vertex-disjoint cycles
;
bipartite tournament
;
minimum degree
刊名:Electronic Notes in Discrete Mathematics
出版年:2016
10.
On constructions of hypotraceable graphs
作者:
Gá
;
bor Wiener
1
;
wiener@cs.bme.hu" class="auth_mail" title="E-mail the corresponding author
关键词:
hypotraceable graph
;
hypohamiltonian graph
;
almost hypohamiltonian graph
刊名:Electronic Notes in Discrete Mathematics
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(328)
题名(6)
作者(210)
关键词(7)
文摘(117)
按出版年细分(328)
2027年及以后(5)
2017年(7)
2016年(13)
2015年(5)
2013年(11)
2012年(21)
2011年(15)
2010年(26)
2009年(23)
2008年(27)
2007年(15)
2006年(18)
2005年(13)
2004年(10)
2003年(14)
2002年(10)
2001年(10)
2000年(14)
2000年及以前(71)
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
.