On the Relationship Between K-Planar and K-Quasi-Planar Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-68705-6_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Long Paths and Toughness of K-Trees and Chordal Planar Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Projective-Planar Graphs With No K 3, 4 -Minor. II

Journal of Graph Theory
GeometryTopology
2016English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Constant Memory Routing in Quasi-Planar and Quasi-Polyhedral Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1986English

Well-Quasi-Ordering Infinite Graphs With Forbidden Finite Planar Minor

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1989English

On the Path-Width of Planar Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2009English

On a Characterization of Planar Graphs

Bulletin of the Australian Mathematical Society
Mathematics
1981English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy