Amanote Research

Amanote Research

    RegisterSign In

Edge-Maximal Graphs of Branchwidth K

Electronic Notes in Discrete Mathematics - Netherlands
doi 10.1016/j.endm.2005.06.075
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

October 1, 2005

Authors
Christophe PaulJan Arne Telle
Publisher

Elsevier BV


Related search

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Graphs With Branchwidth at Most Three

Journal of Algorithms
1999English

Existence of K-Edge Connected Ordinary Graphs With Prescribed Degrees

Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
1964English

Maximal-Clique Partitions of Interval Graphs

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1988English

Biregular Edge-Symmetric Graphs

Colloquium Mathematicum
Mathematics
1984English

Edge Geodetic Parameters of Snake Graphs

Malaya Journal of Matematik
2018English

Extreme Edge Fixed Steiner Graphs

International Journal of Computer Applications
2019English

Edge Domination in Graphs of Cubes

Czechoslovak Mathematical Journal
Mathematics
2002English

Strong Edge Colorings of Uniform Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy