搜索页_+Planar+3-trees

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

常用资源

在“Elsevier电子期刊”中，命中：248条，耗时：0.010995 秒

在所有数据库中总计命中：1,290条

1.Threshold-coloring and unit-cube contact representation of planar graphs

作者：Md. Jawaherul Alam^a ; Steven Chaplick^b ; Ga&scaron ; per Fijavž^d ; Michael Kaufmann^c ; Stephen G. Kobourov^a ; Sergey Pupyrev^a ; ^e ; Jackson Toeniskoetter^a ; ^{jacktoe@email.arizona.edu}

关键词：Graph coloring ; Threshold-coloring ; Planar graphs ; Unit-cube contact representation

刊名：Discrete Applied Mathematics

出版年：2017

2.Gray coding cubic planar maps

作者：Sergey Avgustinovich^a ; ^{avgust@math.nsc.ru" class="auth_mail" title="E-mail the corresponding author} ; Sergey Kitaev^b ; ^{sergey.kitaev@strath.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; Vladimir N. Potapov^a ; ^{vpotapov@math.nsc.ru" class="auth_mail" title="E-mail the corresponding author} ; Vincent Vajnovszki^c ; ^{vvajnov@u-bourgogne.fr" class="auth_mail" title="E-mail the corresponding author}

关键词：Planar map ; Bicubic planar map ; Cubic non-separable planar map ; 3-Connected cubic planar map ; Gray code ; Description tree ; β(0 ; 1)β(0 ; 1)-Tree

刊名：Theoretical Computer Science

出版年：2016

3.Intersection graphs of L-shapes and segments in the plane

作者：Stefan Felsner^a ; ^{felsner@math.tu-berlin.de" class="auth_mail" title="E-mail the corresponding author} ; Kolja Knauer^b ; ^{kolja.knauer@lif.univ-mrs.fr" class="auth_mail" title="E-mail the corresponding author} ; George B. Mertzios^c ; ^{george.mertzios@durham.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; Torsten Ueckerdt^d ; ^{torsten.ueckerdt@kit.edu" class="auth_mail" title="E-mail the corresponding author}

关键词：Intersection graphs ; Segment graphs ; Co-planar graphs ; kk-bend VPGVPG-graphs ; Planar 3-trees

刊名：Discrete Applied Mathematics

出版年：2016

4.An improved upper bound on the linear 2-arboricity of planar graphs

作者：Yiqiao Wang ^{yqwang@bucm.edu.cn" class="auth_mail" title="E-mail the corresponding author}

关键词：Planar graph ; Linear 2-arboricity ; Maximum degree

刊名：Discrete Mathematics

出版年：2016

5.Regular independent sets

作者：Yair Caro^a ; ^{yacaro@kvgeva.org.il" class="auth_mail" title="E-mail the corresponding author} ; Adriana Hansberg^b ; ^{ahansberg@im.unam.mx" class="auth_mail" title="E-mail the corresponding author} ; Ryan Pepper^c ; ^{pepperr@uhd.edu" class="auth_mail" title="E-mail the corresponding author}

关键词：Independence ; kk-independence ; Regular independence ; Planar graphs ; kk-degenerate graphs ; kk-trees

刊名：Discrete Applied Mathematics

出版年：2016

6.Spanning trees with nonseparating paths

作者：Cristina G. Fernandes^a ; ^{cris@ime.usp.br" class="auth_mail" title="E-mail the corresponding author} ; Cé ; sar Herná ; ndez-Vé ; lez^a ; ^{israel@ime.usp.br" class="auth_mail" title="E-mail the corresponding author} ; Orlando Lee^b ; ^{lee@ic.unicamp.br" class="auth_mail" title="E-mail the corresponding author} ; José ; C. de Pina^a ; ^{coelho@ime.usp.br" class="auth_mail" title="E-mail the corresponding author}

关键词：Nonseparating path ; Spanning tree ; Nonseparating fundamental cycle

刊名：Discrete Mathematics

出版年：2016

7.Detection of cherry tree branches with full foliage in planar architecture for automated sweet-cherry harvesting

作者：Suraj Amatya^a ; ^b ; Manoj Karkee^a ; ^b ; ^{manoj.karkee@wsu.edu" class="auth_mail" title="E-mail the corresponding author} ; Aleana Gongal^a ; ^b ; Qin Zhang^a ; ^b ; Matthew D. Whiting^b ; ^c

关键词：Cherry harvesting ; Image segmentation ; Bayesian classifier ; Branch detection ; Vertical planar architecture ; Upright fruiting offshoots

刊名：Biosystems Engineering

出版年：2016

8.On the complexity of the representation of simplicial complexes by trees

作者：Jean-Daniel Boissonnat ; Dorian Mazauric ; ^{dorian.mazauric@inria.fr" class="auth_mail" title="E-mail the corresponding author}

关键词：Simplicial complexes ; Hypergraphs ; Tree representations ; NP-completeness ; APX-completeness ; Approximation algorithms

刊名：Theoretical Computer Science

出版年：2016

9.On constructing rational spanning tree edge densities

作者：Nathan Kahl ^{nathan.kahl@shu.edu" class="auth_mail" title="E-mail the corresponding author}

关键词：Spanning trees ; Resistance distance ; Random walks on graphs

刊名：Discrete Applied Mathematics

出版年：2016

10.On the first-order edge tenacity of a graph

作者：Bahareh Bafandeh^a ; Dara Moazzami^b ; ^{dmoazzami@ut.ac.ir" class="auth_mail" title="E-mail the corresponding author} ; Amin Ghodousian^b

关键词：Edge-tenacity ; Planar graph ; Balancity

刊名：Discrete Applied Mathematics

出版年：2016

按检索点细分(248)

题名(30)

关键词(23)

文摘(204)

按出版年细分(248)

2027年及以后(6)

2017年(1)

2016年(12)

2015年(3)

2013年(12)

2012年(22)

2011年(5)

2010年(9)

2009年(27)

2008年(21)

2007年(16)

2006年(14)

2005年(11)

2004年(9)

2003年(14)

2002年(17)

2001年(2)

2000年(9)

2000年及以前(38)