设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(3)
SpringerLink电子期刊(32)
ProQuest学位论文(1)
Elsevier电子期刊(49)
在“
Elsevier电子期刊
”中,
命中:
49
条,耗时:小于0.01 秒
在所有数据库中总计命中:
85
条
1.
Minimum size of feedback vertex sets of planar
graphs
of girth at least five
作者:
Tom Kelly
a
;
t9kelly@uwaterloo.ca
;
Chun-Hung Liu
b
;
chliu@math.princeton.edu
刊名:European Journal of Combinatorics
出版年:2017
2.
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of
graphs
作者:
Ali Dehghan
a
;
alidehghan@sce.carleton.ca
;
Mohsen Mollahajiaghaei
b
;
mmollaha@uwo.ca
关键词:
Closed distinguishing labeling
;
List closed distinguishing labeling
;
Strong closed distinguishing labeling
;
Computational complexity
;
Combinatorial Nullstellensatz
刊名:Discrete Applied Mathematics
出版年:2017
3.
On the hardness of computing span of
subcubic
graphs
作者:
Robert Janczewski
;
skalar@eti.pg.gda.pl" class="auth_mail" title="E-mail the corresponding author
;
Krzysztof Turowski
Krzysztof.Turowski@eti.pg.gda.pl" class="auth_mail" title="E-mail the corresponding author
关键词:
Subcubic
graphs
;
Span
;
Vertex coloring
;
Computational complexity
刊名:Information Processing Letters
出版年:2016
4.
A -approximation for
subcubic
2EC using circulations and obliged edges
作者:
Sylvia Boyd
;
sboyd@uottawa.ca" class="auth_mail" title="E-mail the corresponding author
;
Yao Fu
yfu099@uottawa.ca" class="auth_mail" title="E-mail the corresponding author
;
Yu Sun
ysun007@uottawa.ca" class="auth_mail" title="E-mail the corresponding author
关键词:
Minimum 2-edge-connected subgraph problem
;
Approximation algorithm
;
Circulations
;
Integrality gap
;
Subcubic
graphs
刊名:Discrete Applied Mathematics
出版年:2016
5.
Star Chromatic Index of
Subcubic
Graphs
作者:
Kavita Pradeep
kavita2428@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Subcubic
graph
;
Maximum average degree
;
Girth
刊名:Electronic Notes in Discrete Mathematics
出版年:2016
6.
Equitable vertex arboricity of
subcubic
graphs
作者:
Xin Zhang
xzhang@xidian.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Equitable coloring
;
Equitable partition
;
Vertex arboricity
;
Subcubic
graph
刊名:Discrete Mathematics
出版年:2016
7.
Strategic balance in
graphs
作者:
Robert Lewoń
a
;
lewon.robert@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Anna Małafiejska
b
;
anna@animima.org" class="auth_mail" title="E-mail the corresponding author
;
Michał Małafiejski
a
;
michal@animima.org" class="auth_mail" title="E-mail the corresponding author
关键词:
Global alliance
;
Alliance partitioning number
;
Strategic balance
刊名:Discrete Mathematics
出版年:2016
8.
-packing colorings of cubic
graphs
作者:
Nicolas Gastineau
ngastineau87@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Olivier Togni
关键词:
Graph
;
Coloring
;
Packing chromatic number
;
Cubic graph
刊名:Discrete Mathematics
出版年:2016
9.
Global defensive sets in
graphs
作者:
Robert Lewoń
a
;
lewon.robert@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Anna Małafiejska
b
;
anna@animima.org" class="auth_mail" title="E-mail the corresponding author
;
Michał Małafiejski
a
;
michal@animima.org" class="auth_mail" title="E-mail the corresponding author
关键词:
Defensive set
;
Alliance
;
Domination
;
NPNP-completeness
刊名:Discrete Mathematics
出版年:2016
10.
Interval incidence coloring of bipartite
graphs
作者:
Robert Janczewski
;
Anna Ma艂afiejska
;
Micha艂 Ma艂afiejski
关键词:
Interval incidence coloring
;
Bipartite
graphs
;
Subcubic
graphs
;
Trees
刊名:Discrete Applied Mathematics
出版年:31 March, 2014
1
2
3
4
5
按检索点细分(49)
题名(23)
关键词(12)
文摘(32)
按出版年细分(49)
2027年及以后(3)
2017年(2)
2016年(7)
2014年(1)
2013年(4)
2012年(4)
2011年(4)
2010年(3)
2009年(6)
2008年(3)
2007年(3)
2006年(2)
2004年(1)
2000年及以前(6)
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
.