Proof of a conjecture of Bowlin and Brin on four-colouring triangulations
โ Scribed by Seymour, Paul
- Book ID
- 121463539
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 331 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume
## Abstract Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function __r__~__f__~ (__a__~1~, __a__~2~, โฆ, __a__~__k__~) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case __k__=2. In this
## Abstract Let __ir__(__G__) and ฮณ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=ฮณ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel