Amanote Research

Amanote Research

    RegisterSign In

Graphs With Branchwidth at Most Three

Journal of Algorithms
doi 10.1006/jagm.1999.1011
Full Text
Open PDF
Abstract

Available in full text

Date

August 1, 1999

Authors
Hans L BodlaenderDimitrios M Thilikos
Publisher

Elsevier BV


Related search

Nonsingular Unicyclic Mixed Graphs With at Most Three Eigenvalues Greater Than Two

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2007English

Edge-Maximal Graphs of Branchwidth K

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2005English

Integral Regular Net-Balanced Signed Graphs With Vertex Degree at Most Four

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Existence of Regular Nut Graphs for Degree at Most 11

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

On Regular Signed Graphs With Three Eigenvalues

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Varieties With at Most Cubic Growth

Journal of Algebra
Number TheoryAlgebra
2019English

The Inequalities of Morse When the Maximum Type Is at Most Three

Bulletin of the American Mathematical Society
1940English

Visualizing Graphs in Three Dimensions

ACM Transactions on Applied Perception
Theoretical Computer ScienceComputer ScienceExperimentalCognitive Psychology
2008English

A SAT Approach to Branchwidth

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy