𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the colorings of outerplanar graphs

✍ Scribed by Weifan Wang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
601 KB
Volume
147
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On list-coloring outerplanar graphs
On list-coloring outerplanar graphs
✍ Joan P. Hutchinson πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

## Abstract We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors __L__ (__v__ ) for each vertex __v__ such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be __L__‐list‐colored (except when

On reconstructing maximal outerplanar gr
On reconstructing maximal outerplanar graphs
✍ William B. Giles πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 421 KB

Let C; be a graph, u a vertex of G, and G -{u) the subgraph of G obtained from G by removing the vertex u and all arcs incident with u. G-$1 is calted a point~e~eti~n of G. In f 51, Ulam conjectured that if G has at least three vertices, then G can be reconstructed (up to isomorphism) froin the coil

On Total Colorings of Graphs
On Total Colorings of Graphs
✍ C. Mcdiarmid; B. Reed πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 299 KB

AND Bruce Reed Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, Canada

Pathwidth of outerplanar graphs
Pathwidth of outerplanar graphs
✍ David Coudert; Florian Huc; Jean-SΓ©bastien Sereni πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 238 KB

## Abstract We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geo