设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(2)
CNKI学位论文(14)
CNKI期刊论文0611(1)
知网期刊论文(4)
在“
Elsevier电子期刊
”中,
命中:
24
条,耗时:0.0159909 秒
在所有数据库中总计命中:
21
条
1.
Kempe equivalence of colourings of cubic graphs
作者:
Carl Feghali
carl.feghali@durham.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Matthew Johnson
matthew.johnson2@durham.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Dani
ë
;
l
Paulusma
dani
el.
paulusma
@durham.ac.uk" class="auth_mail" title="E-mail the corresponding author
刊名:European Journal of Combinatorics
出版年:2017
2.
Classifying the clique-width of -free bipartite graphs
作者:
Konrad K. Dabrowski
;
konrad.dabrowski@durham.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Dani
ë
;
l
Paulusma
dani
el.
paulusma
@durham.ac.uk" class="auth_mail" title="E-mail the corresponding author
关键词:
Clique-width
;
Bipartite graph
;
Graph class
刊名:Discrete Applied Mathematics
出版年:2016
3.
Kempe Equivalence of Colourings of Cubic Graphs
作者:
Carl Feghali
carl.feghali@dur.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Matthew Johnson
matthew.johnson2@dur.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Dani
ë
;
l
Paulusma
1
;
dani
el.
paulusma
@dur.ac.uk" class="auth_mail" title="E-mail the corresponding author
关键词:
Kempe equivalence
;
cubic graph
;
graph colouring
刊名:Electronic Notes in Discrete Mathematics
出版年:2015
4.
Colouring of graphs with Ramsey-type forbidden subgraphs
作者:
Konrad K. Dabrowski
;
Petr A. Golovach
;
Dani
el
Paulusma
关键词:
Colouring
;
Independent set
;
Clique
;
Forbidden induced subgraphs
刊名:Theoretical Computer Science
出版年:20 February, 2014
5.
List coloring in the absence of two subgraphs
作者:
Petr A. Golovach
;
Dani
毛l
Paulusma
关键词:
List coloring
;
Forbidden induced subgraph
;
Computational complexity
刊名:Discrete Applied Mathematics
出版年:31 March, 2014
6.
Lift-contractions
作者:
Petr A. Golovach
;
Dani
?l
Paulusma
;
Marcin Kami¨½ski
;
Dimitrios M. Thilikos
刊名:European Journal of Combinatorics
出版年:2014
7.
4-coloring -free graphs when is small
作者:
Petr A. Golovach
;
Dani
?l
Paulusma
;
Jian Song
关键词:
Graph coloring
;
Forbidden induced subgraph
;
Linear forest
;
Polynomial-time algorithm
刊名:Discrete Applied Mathematics
出版年:2013
8.
Updating the complexity status of coloring graphs without a fixed induced linear forest
作者:
Hajo
;
Broersma
a
;
;
hajo.broersma@durham.ac.uk
;
Petr A.
;
Golovach
a
;
;
petr.golovach@durham.ac.uk
;
Dani
ë
;
l
;
Paulusma
;
;
;
a
;
;
dani
el.
paulusma
@durham.ac.uk
;
Jian
;
Song
a
;
;
jian.song@durham.ac.uk
关键词:
Graph coloring
;
Forbidden induced subgraph
;
Linear forest
刊名:Theoretical Computer Science
出版年:2012
9.
Computing vertex-surjective homomorphisms to partially reflexive trees
作者:
Petr A. Golovach
;
Dani
?l
Paulusma
;
Jian Song
关键词:
Graph homomorphism
;
Surjectivity
;
Computational complexity
刊名:Theoretical Computer Science
出版年:2012
10.
Editorial
作者:
Iain A. Stewart
;
i.a.stewart@durham.ac.uk
;
Dani
el
Paulusma
;
Matthew Johnson
刊名:Journal of Discrete Algorithms
出版年:2012
1
2
3
按检索点细分(24)
作者(24)
按出版年细分(24)
2027年及以后(1)
2017年(1)
2016年(1)
2015年(1)
2014年(1)
2013年(1)
2012年(3)
2010年(4)
2009年(3)
2008年(3)
2007年(1)
2005年(1)
2004年(1)
2001年(1)
2000年及以前(1)
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
.