✦ LIBER ✦

Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs

✍ Scribed by Iztok Peterin

Publisher: Springer Netherlands
Year: 2004
Tongue: English
Weight: 198 KB
Volume: 21
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-004-0023-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On subgraphs of Cartesian product graphs

On subgraphs of Cartesian product graphs and S-primeness

✍ Boštjan Breš;ar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Characterizing path graphs by forbidden

Characterizing path graphs by forbidden induced subgraphs

✍ Benjamin Lévêque; Frédéric Maffray; Myriam Preissmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. © 2009

Characterizing subgraphs of Hamming grap

Characterizing subgraphs of Hamming graphs

✍ Sandi Klavžar; Iztok Peterin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph __G__ is an induced subgraph of a Hamming graph i

Characterization of the cartesian produc

Characterization of the cartesian product of complete graphs by convex subgraphs

✍ Yoshimi Egawa 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 115 KB

We show that if G is a connected graph with the same proper convex subgraphs as (Kn)', the Cartesian product of r copies of Kn, r >t 2, n >t 3, then [V(G)I ~> n" with equality if and only if G is isomorphic to (Kn)'. In this note we consider only connected finite undirected simple graphs. The compl

An induced subgraph characterization of

An induced subgraph characterization of domination perfect graphs

✍ Igor E. Zvervich; Vadim E. Zverovich 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

## Abstract Let γ(__G__) ι(__G__) be the domination number and independent domination number of a graph (__G__), respectively. A graph (__G__) is called domination perfect if γ(__H__) = ι(__H__), for every induced subgraph __H__ of (__G__). There are many results giving a partial characterization o

Game coloring the Cartesian product of g

Game coloring the Cartesian product of graphs

✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat