Plane Triangulations Without a Spanning Halin Subgraph II

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/16m1072693
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

More Efficient Generation of Plane Triangulations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Generating Rooted Triangulations Without Repetitions

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1996English

Knots Without Unknotted Incompressible Spanning Surfaces

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

Optimal Bichromatic Plane Spanning Trees for Special Point Sets

English

Rudolf Halin: 1934–2014

Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
2016English

Learning a Hidden Subgraph

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Subgraph Matching

Proceedings of the VLDB Endowment
Computer Science
2017English

Super Triangulations

Pacific Journal of Mathematics
Mathematics
1978English

Hamiltonian Properties of Generalized Halin Graphs

Canadian Mathematical Bulletin
Mathematics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy