✦ LIBER ✦

Biregular subgraphs of biregular graphs

✍ Scribed by S Sridharan

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 103 KB
Volume: 65
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90144-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Distance Biregular Bipartite Graphs

✍ C. Delorme 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We describe here some properties of a class of graphs which extends the class of distance regular graphs: our graphs are bipartite and for cach vertex there exists an intersection array depending on the stable component of the vertex. Thus our graphs arc to distance regular graphs as bipartite regul

Proper path-factors and interval edge-co

Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs

✍ Armen S. Asratian; Carl Johan Casselgren; Jennifer Vandenbussche; Douglas B. Wes 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract An __interval coloring__ of a graph __G__ is a proper coloring of __E__(__G__) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)‐__biregular bigraph__ is a bipartite graph in which each vertex of one part has degree 3 and each vertex

Subgraphs of graphs, I

✍ Paul A. Catlin 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 737 KB

&et G' and H aphs on p vertices. We give a suffictent Londition, based f the verrices of G and the maximum degree of t w vertices of ff' for Throughout this paper, all graphs considered are finite and simpl;. The C&~WP of a vertex v in the graph G is denoted deg<; (v). The vertex set of G is dencted

Pancyclic subgraphs of random graphs

✍ Choongbum Lee; Wojciech Samotij 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract An __n__‐vertex graph is called pancyclic if it contains a cycle of length __t__ for all 3≤__t__≤__n__. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if __p__>__n__^−1/2^, then the random graph __G__(__n, p__) a.a.s. satisfies the f

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