设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
在“
Elsevier电子期刊
”中,
命中:
9
条,耗时:小于0.01 秒
1.
Low 5-stars in normal plane maps with minimum degree 5
作者:
O.V. Borodin
a
;
brdnoleg@math.nsc.ru
;
A.O. Ivanova
b
;
shmgnanna@mail.ru
关键词:
Normal plane map
;
Plane graph
;
3-polytope
;
Structural property
;
Star
;
Height
刊名:Discrete Mathematics
出版年:2017
2.
On the maximum weight of a dense connected graph of given order and size
作者:
Mirko Horňá
;
k
a
;
mirko.hornak@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
Stanislav
Jendrol
&
rsquo
;
a
;
stanislav.
jendrol
@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
Ingo Schiermeyer
b
;
ingo.schiermeyer@tu-freiberg.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Weight of an edge
;
Weight of a graph
;
Connected graph
刊名:Discrete Mathematics
出版年:2016
3.
Facial packing edge-coloring of plane graphs
作者:
Jú
;
lius Czap
a
;
julius.czap@tuke.sk" class="auth_mail" title="E-mail the corresponding author
;
Stanislav
Jendrol
&
rsquo
;
b
;
stanislav.
jendrol
@upjs.sk" class="auth_mail" title="E-mail the corresponding author
关键词:
Facial packing edge-coloring
;
Plane graph
刊名:Discrete Applied Mathematics
出版年:2016
4.
Facial entire colouring of plane graphs
作者:
I. Fabrici
igor.fabrici@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
S.
Jendrol
&
rsquo
;
;
stanislav.
jendrol
@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
M. Vrbjarová
;
michaela.vrbjarova@student.upjs.sk" class="auth_mail" title="E-mail the corresponding author
关键词:
Plane graph
;
Entire colouring
;
Facial colouring
;
Edge&ndash
;
face colouring
刊名:Discrete Mathematics
出版年:2016
5.
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
作者:
S.
Jendrol
&
rsquo
;
a
;
stanislav.
jendrol
@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
M. Maceková
;
a
;
maria.macekova@student.upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
M. Montassier
b
;
mickael.montassier@lirmm.fr" class="auth_mail" title="E-mail the corresponding author
;
R. Sotá
;
k
a
;
roman.sotak@upjs.sk" class="auth_mail" title="E-mail the corresponding author
关键词:
Girth
;
Optimal unavoidable set
;
3-path
;
Planar graph
刊名:Discrete Mathematics
出版年:2016
6.
Facial list colourings of plane graphs
作者:
Igor Fabrici
a
;
igor.fabrici@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
Stanislav
Jendrol
&
rsquo
;
a
;
stanislav.
jendrol
@upjs.sk" class="auth_mail" title="E-mail the corresponding author
;
Margit Voigt
b
;
mvoigt@informatik.htw-dresden.de" class="auth_mail" title="E-mail the corresponding author
关键词:
List colouring
;
Facial colouring
;
Total colouring
;
Entire colouring
;
Plane graph
刊名:Discrete Mathematics
出版年:2016
7.
The weight of faces in normal plane maps
作者:
O.V. Borodin
a
;
brdnoleg@math.nsc.ru" class="auth_mail" title="E-mail the corresponding author
;
A.O. Ivanova
b
;
shmgnanna@mail.ru" class="auth_mail" title="E-mail the corresponding author
关键词:
Plane map
;
Planar graph
;
3-polytope
;
Structural properties
;
Weight
刊名:Discrete Mathematics
出版年:2016
8.
Light subgraphs of graphs embedded in the plane¡ªA survey
作者:
S.
Jendrol
&
rsquo
;
a
;
stanislav.
jendrol
@upjs.sk
;
H.-J. Voss
b
;
1
关键词:
Light subgraphs
;
Weight of subgraph
;
Plane graphs
刊名:Discrete Mathematics
出版年:2013
9.
A Dirac theorem for trestles
作者:
Stanislav
Jendrol
&
rsquo
;
a
;
stanislav.
jendrol
@upjs.sk
;
Tomá
;
&scaron
;
Kaiser
b
;
kaisert@kma.zcu.cz
;
Zden¨§k Ryjá
;
?ek
b
;
ryjacek@kma.zcu.cz
;
Ingo Schiermeyer
c
;
Ingo.Schiermeyer@tu-freiberg.de
关键词:
Graph
;
Trestle
;
Minimum degree
刊名:Discrete Mathematics
出版年:2012
1
按检索点细分(9)
作者(7)
文摘(3)
按出版年细分(9)
2017年(1)
2016年(6)
2013年(1)
2012年(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
.