✦ LIBER ✦

The A4-structure of a graph

✍ Scribed by Michael D. Barrus; Douglas B. West

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 215 KB
Volume: 71
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20639

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Local Structure of a Bipartite Dista

The Local Structure of a Bipartite Distance-regular Graph

✍ Brian Curtin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 285 KB

In this paper, we consider a bipartite distance-regular graph = (X, E) with diameter d ≥ 3. We investigate the local structure of , focusing on those vertices with distance at most 2 from a given vertex x. To do this, we consider a subalgebra R = R(x) of Mat X (C), where X denotes the set of vertice

A method for the algorithmic description

A method for the algorithmic description of the cyclical structure of a graph

✍ G.F. Stepanets; G.E. Vleduts 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 335 KB

The structure of quasi 4-connected graph

The structure of quasi 4-connected graphs

✍ Themistocles Politof; A. Satyanarayana 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A minimal point disconnecting set S of a graph G is a nontrivial m-separator, where m = IS I, if the connected components of G -S can be partitioned into two subgraphs each of which has at least two points. A 3-connected graph is quasi 4-connected if it has no nontrivial 3separators. This paper prov

On the P4-structure of Perfect Graphs. I

On the P4-structure of Perfect Graphs. IV. Partner graphs

✍ Ryan B Hayward; William J Lenhart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 318 KB

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

K4−-factor in a graph

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract Let __G__ be a graph of order 4__k__ and let δ(__G__) denote the minimum degree of __G__. Let __F__ be a given connected graph. Suppose that |__V__(__G__)| is a multiple of |__V__(__F__)|. A spanning subgraph of __G__ is called an __F__‐factor if its components are all isomorphic to __F