设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(2)
CNKI学位论文(93)
知网期刊论文(30)
在“
Elsevier电子期刊
”中,
命中:
52
条,耗时:小于0.01 秒
在所有数据库中总计命中:
125
条
1.
Maximal-
clique
partitions and the Roller Coaster Conjecture
作者:
Jonathan Cutler
a
;
1
;
jonathan.cutler@montclair.edu" class="auth_mail" title="E-mail the corresponding author
;
Luke Pebody
b
;
luke@pebody.org" class="auth_mail" title="E-mail the corresponding author
关键词:
Independence polynomial
;
Well-covered graphs
;
Clique
covering
s
刊名:Journal of Combinatorial Theory, Series A
出版年:2017
2.
On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture
作者:
Hilal A. Ganie
a
;
hilahmad1119kt@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Ahmad M. Alghamdi
b
;
amghamdi@uqu.edu.sa" class="auth_mail" title="E-mail the corresponding author
;
S. Pirzada
a
;
pirzadasd@kashmiruniversity.ac.in" class="auth_mail" title="E-mail the corresponding author
关键词:
05C30
;
05C50
刊名:Linear Algebra and its Applications
出版年:2016
3.
Matching divisible designs with block size four
作者:
Peter J. Dukes
a
;
dukes@uvic.ca" class="auth_mail" title="E-mail the corresponding author
;
Tao Feng
b
;
tfeng@bjtu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Alan C.H. Ling
c
;
aling@cems.uvm.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Group divisible design
;
Graph factorization
;
Edge-decomposition
刊名:Discrete Mathematics
出版年:2016
4.
On the complexity of the positive semidefinite zero forcing number
作者:
Shaun Fallat
a
;
1
;
Shaun.Fallat@uregina.ca" class="auth_mail" title="E-mail the corresponding author
;
Karen Meagher
a
;
2
;
Karen.Meagher@uregina.ca" class="auth_mail" title="E-mail the corresponding author
;
Boting Yang
b
;
3
;
Boting.Yang@uregina.ca" class="auth_mail" title="E-mail the corresponding author
关键词:
05C35
;
05C50
;
05C78
;
05C85
;
68R10
刊名:Linear Algebra and its Applications
出版年:2016
5.
Closure,
clique
covering
and degree conditions for Hamilton-connectedness in claw-free graphs
作者:
Roman Ku?el
rkuzel@kma.zcu.cz
;
Zden¨§k Ryjá
;
?ek
;
ryjacek@kma.zcu.cz
;
Jakub Teska
teska@kma.zcu.cz
;
Petr Vrá
;
na
vranap@kma.zcu.cz
关键词:
Claw-free
;
Closure
;
Hamilton-connected
;
Degree condition
;
Clique
covering
刊名:Discrete Mathematics
出版年:2012
6.
Clique
-transversal sets and
clique
-coloring in planar graphs
作者:
Erfang Shan
;
Zuosong Liang
;
Liying Kang
刊名:European Journal of Combinatorics
出版年:February, 2014
7.
Clique
versus independent set
作者:
N. Bousquet
a
;
nicolas.bousquet@lirmm.fr" class="auth_mail
;
A. Lagoutte
b
;
aurelie.lagoutte@ens-lyon.fr" class="auth_mail
;
S. Thomassé
;
b
;
stephan.thomasse@ens-lyon.fr" class="auth_mail
刊名:European Journal of Combinatorics
出版年:August, 2014
8.
The maximum vertex coverage problem on bipartite graphs
作者:
Nicola Apollonio
;
Bruno Simeone
关键词:
Vertex cover
;
Transversal number
;
Matching
;
Hypergraphs
;
Clique
covering
;
NP-hardness
刊名:Discrete Applied Mathematics
出版年:11 March, 2014
9.
Combinatorial bounds on nonnegative rank and extended formulations
作者:
Samuel Fiorini
;
Volker Kaibel
;
Kanstantsin Pashkovich
;
Dirk Oliver Theis
关键词:
Nonnegative rank
;
Extended formulations
;
Projections of polytopes
;
Boolean rank
;
Bi
clique
covering
in bipartite graphs
刊名:Discrete Mathematics
出版年:2013
10.
Hardness results for
covering
arrays avoiding forbidden edges and error-locating arrays
作者:
Elizabeth
;
Maltais
a
;
Lucia
;
Moura
;
;
;
a
;
;
lucia@site.uottawa.ca
关键词:
Covering
arrays
;
Forbidden interactions
;
Edge
clique
covers
;
Error-locating arrays
;
NP-completeness
;
Hardness of approximation
;
Software testing
;
Hardware testing
刊名:Theoretical Computer Science
出版年:2011
1
2
3
4
5
6
按检索点细分(52)
题名(11)
关键词(15)
文摘(37)
按出版年细分(52)
2027年及以后(2)
2017年(1)
2016年(3)
2013年(1)
2012年(2)
2011年(2)
2010年(5)
2009年(6)
2008年(2)
2007年(1)
2006年(4)
2005年(1)
2004年(1)
2003年(2)
2002年(3)
2001年(2)
2000年(2)
2000年及以前(12)
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
.