✦ LIBER ✦

Unidirectional star graphs

✍ Scribed by Khaled Day; Anand Tripathi

Book ID: 103102783
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 568 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90013-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Star-Uniform Graphs

✍ Mikio Kano; Yunjian Wu; Qinglin Yu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 259 KB

Star-transitive graphs

✍ L. L. Velikovich 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 226 KB

The (n, k)-star graph: A generalized sta

The (n, k)-star graph: A generalized star graph

✍ Chiang Wei-Kuo; Chen Rong-Jaye 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Star arboricity of graphs

✍ S.L. Hakimi; J. Mitchem; E. Schmeichel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 279 KB

We develop a connection between vertex coloring in graphs and star arboricity which allows us to prove that every planar graph has star arboricity at most 5. This settles an open problem raised independently by Algor and Alon and by Ringel. We also show that deciding if a graph has star arboricity 2

Star partitions of graphs

✍ Egawa, Y.; Kano, M.; Kelmans, Alexander K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 2 views

Let G be a graph and n ≥ 2 an integer. We prove that the following are equivalent: (i) there is a partition , and (ii) for every subset S of V (G), G \ S has at most n|S| components with the property that each of their blocks is an odd order complete graph.

Star coloring of graphs

✍ Guillaume Fertin; André Raspaud; Bruce Reed 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract A __star coloring__ of an undirected graph __G__ is a proper vertex coloring of __G__ (i.e., no two neighbors are assigned the same color) such that any path of length 3 in __G__ is not bicolored. The __star chromatic number__ of an undirected graph __G__, denoted by χ~s~(__G__), is the