๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On an approach to the problem of color patterns of plane graphs. II

โœ Scribed by G. A. Donets

Publisher
Springer US
Year
1974
Tongue
English
Weight
838 KB
Volume
8
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Structural properties of plane graphs wi
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
โœ O. V. Borodin ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB ๐Ÿ‘ 1 views

If in a plane graph with minimum degree 2 3 no t w o triangles have an edge in common, then: (1 there are two adjacent vertices with degree sum at most 9, and (2) there is a face of size between 4 and 9 or a 10-face incident with ten 3-vertices. It follows that every planar graph without cycles betw

A note on the complexity of longest path
A note on the complexity of longest path problems related to graph coloring
โœ P.M. Pardalos; A. Migdalas ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem.

The solution to an extremal problem on b
The solution to an extremal problem on balanced extensions of graphs
โœ A. Ruciล„ski; A. Vince ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 694 KB

## Abstract For __n__ sufficiently large the order of a smallest balanced extension of a graph of order __n__ is, in the worst case, โŒŠ(__n__ + 3)^2^/8โŒ‹. ยฉ 1993 John Wiley & Sons, Inc.