设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(52)
馆藏书目(1)
万方学术会议(1)
CNKI学位论文(5467)
知网期刊论文(5170)
中国地质文献-英文(6)
Springer电子图书(101)
CNKI会议论文(11)
CNKI期刊论文0611(16)
万方学位论文(6)
在“
Elsevier电子期刊
”中,
命中:
11,923
条,耗时:小于0.01 秒
在所有数据库中总计命中:
10,831
条
1.
Degree sum conditions for
vertex
-disjoint cycles passing through specified vertices
作者:
Shuya Chiba
a
;
schiba@kumamoto-u.ac.jp
;
Tomoki Yamashita
b
;
yamashita@math.kindai.ac.jp
关键词:
Vertex
-disjoint cycles
;
Partitions
;
Degree conditions
;
Specified
vertex
subsets
刊名:Discrete Mathematics
出版年:2017
2.
The price of connectivity for feedback
vertex
set
作者:
Ré
;
my Belmonte
a
;
remybelmonte@gmail.com
;
Pim van 't Hof
b
;
p.van.t.hof@hr.nl
;
Marcin Kamiński
c
;
mjk@mimuw.edu.pl
;
Danië
;
l Paulusma
d
;
daniel.paulusma@durham.ac.uk
关键词:
Price of connectivity
;
Feedback
vertex
set
;
Connected feedback
vertex
set
;
Forbidden induced subgraph
刊名:Discrete Applied Mathematics
出版年:2017
3.
Vertex
-coloring -edge-weighting of some graphs
作者:
Yezhou Wu
a
;
yezhouwu@zju.edu.cn
;
Cun-Quan Zhang
b
;
cqzhang@mail.wvu.edu
;
Bao-Xuan Zhu
c
;
bxzhu@jsnu.edu.cn
关键词:
1-2-3-conjecture
;
Vertex
-coloring 3-edge-weighting
;
Spanning trees
刊名:Discrete Mathematics
出版年:2017
4.
Solving
vertex
coloring problems as maximum weight stable set problems
作者:
Denis Cornaz
a
;
denis.cornaz@dauphine.fr
;
Fabio Furini
a
;
fabio.furini@dauphine.fr
;
Enrico Malaguti
b
;
enrico.malaguti@unibo.it
关键词:
Vertex
coloring
;
Stable set
;
Mixed integer linear programming
;
Computational experiments
刊名:Discrete Applied Mathematics
出版年:2017
5.
Adjacent
vertex
distinguishing total coloring of graphs with maximum degree 4
作者:
You Lu
a
;
luyou@nwpu.edu.cn
;
Jiaao Li
b
;
joli@mix.wvu.edu
;
Rong Luo
b
;
rluo@math.wvu.edu
;
Zhengke Miao
c
;
zkmiao@jsnu.edu.cn
关键词:
Adjacent
vertex
distinguishing total coloring
;
Combinatorial Nullstellensatz
;
Maximum degree
刊名:Discrete Mathematics
出版年:2017
6.
Smallest tetravalent half-arc-transitive graphs with the
vertex
-stabiliser isomorphic to the dihedral group of order 8
作者:
Primož Potočnik
a
;
1
;
primoz.potocnik@fmf.uni-lj.si" class="auth_mail" title="E-mail the corresponding author
;
Rok Požar
b
;
pozar.rok@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Graph
;
Tetravalent
;
Vertex
-transitive
;
Edge-transitive
刊名:Journal of Combinatorial Theory, Series A
出版年:2017
7.
Coloring graphs without fan
vertex
-minors and graphs without cycle pivot-minors
作者:
Ilkyoo Choi
a
;
1
;
ilkyoo@kaist.ac.kr
;
O-joung Kwon
b
;
2
;
ojoungkwon@gmail.com
;
Sang-il Oum
a
;
3
;
sangil@kaist.edu
关键词:
Chromatic number
;
Chi-bounded class
;
Vertex
-minor
;
Pivot-mino
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
8.
Complexity and algorithms for the connected
vertex
cover problem in 4-regular graphs
作者:
Yuchao Li
liyu_chao@126.com
;
Zishen Yang
yangzishen@sina.com
;
Wei Wang
;
wang_weiw@163.com
关键词:
Connected
vertex
cover problem
;
Approximation algorithm
;
4-regular graph
刊名:Applied Mathematics and Computation
出版年:2017
9.
A fast algorithm for
vertex
-frequency representations of signals on graphs
作者:
Iva Jestrović
a
;
James L. Coyle
b
;
Ervin Sejdić
a
;
esejdic@ieee.org" class="auth_mail" title="E-mail the corresponding author
关键词:
Graph signal processing
;
Vertex
-frequency analysis
;
Windowed graph Fourier transform
;
Graph S-transform
刊名:Signal Processing
出版年:2017
10.
Treewidth and Pathwidth parameterized by the
vertex
cover number
关键词:
Treewidth
;
Pathwidth
;
Vertex
cover
;
Parameterized algorithms
刊名:Discrete Applied Mathematics
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(11923)
题名(1875)
作者(1)
关键词(1782)
文摘(11183)
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
.