✦ LIBER ✦

A new invariant of plane bipartite cubic graphs

✍ Scribed by François Jaeger

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 999 KB
Volume: 101
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90599-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inductive classes of bipartite cubic gra

Inductive classes of bipartite cubic graphs

✍ Vladimir Batagelj 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 269 KB

In the paper two (a local and an expanding) inductive definitions of the class of all simple connected bipartite cubic graphs are given. ## 0. ~n~~uction We shall use the notions and notations from [l, 31. An inductive definition of a class Cn(S?'; 9) is local iff for each rule from 9 the part of

Bipartite cubic graphs and a shortness e

Bipartite cubic graphs and a shortness exponent

✍ P.J. Owens 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 148 KB

The class of 3-connected bipartite cubic graphs is shown to contain a oon-Hamiltonian graph with only 78 vertices and to have a shortness exponent less than one. In this paper, a graph is a simple undirected gaph and a subgraph is an induced subgraph. For a~ay graph G, v(G) denotes the number of ve

Extremal bipartite subgraphs of cubic tr

Extremal bipartite subgraphs of cubic triangle-free graphs

✍ Glenn Hopkins; William Staton 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

On locating cubic subgraphs in bounded-d

On locating cubic subgraphs in bounded-degree connected bipartite graphs

✍ Iain A Stewart 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete.

Interval coloring of (3,4)-biregular bip

Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs

✍ A. V. Pyatkin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract An interval coloring of a graph is a proper edge coloring such that the set of used colors at every vertex is an interval of integers. Generally, it is an NP‐hard problem to decide whether a graph has an interval coloring or not. A bipartite graph __G__ = (__A__,__B__;__E__) is (α, β)‐b

s-Regular cubic graphs as coverings of t

s-Regular cubic graphs as coverings of the complete bipartite graph K3,3

✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts freely and transitively on the set of __s__‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the __s__‐regular cyclic cov