✦ LIBER ✦

Current and voltage graphs of a composite graph

✍ Scribed by Hans Dieter Fischer

Publisher: John Wiley and Sons
Year: 1974
Tongue: English
Weight: 293 KB
Volume: 2
Category: Article
ISSN: 0098-9886
DOI: 10.1002/cta.4490020209

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A contribution to the theory of voltage

A contribution to the theory of voltage graphs

✍ Martin Škoviera 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Voltage graph embeddings and the associa

Voltage graph embeddings and the associated block designs

✍ Brian L. Garman 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 663 KB

## Abstract The voltage graph construction of Gross (orientable case) and Stahl as well as Gross and Tucker (nonorientable case) is extended to the case where the base graph is embedded in a pseudosurface or a generalized pseudosurface. This theory is then applied to produce triangular embeddings o

Partition graphs and coloring numbers of

Partition graphs and coloring numbers of a graph

✍ E. Sampathkumar; V.N. Bhave 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 288 KB

A relationship between triangulated grap

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs

✍ Dale J. Skrien 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

A common generalization of line graphs a

A common generalization of line graphs and clique graphs

✍ Erich Prisner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 664 KB

## Abstract Both the line graph and the clique graph are defined as intersection graphs of certain families of complete subgraphs of a graph. We generalize this concept. By a __k__‐edge of a graph we mean a complete subgraph with __k__ vertices or a clique with fewer than __k__ vertices. The __k__‐

The decompositions of line graphs, middl

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

✍ Jin Akiyama; Takashi Hamada 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons