✦ LIBER ✦

Unicyclic realizability of a degree list

✍ Scribed by F. T. Boesch; F. Harary

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 172 KB
Volume: 8
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230080202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Realizability of p-point graphs with pre

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Δ, δ, λ) graph as a graph having __p__ points,

Realizable Classes of Quaternion Extensi

Realizable Classes of Quaternion Extensions of Degree 4ℓ

✍ Bouchaı̈b Sodaı̈gui 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Let k be a number field and O k its ring of integers. Let 1 be the generalized quaternion group of order 4l, where l is an odd prime number. Let M be a maxi- and Cl(M) its class group. We denote by R(M) the subset of Cl(M) formed by the realizable classes in the sense of McCulloh. In this article w

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree

✍ D. DiMarco 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 3 views

Graphic sequences have realizations cont

Graphic sequences have realizations containing bisections of large degree

✍ Stephen G. Hartke; Tyler Seacrest 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

A __bisection__ of a graph is a balanced bipartite spanning sub‐graph. Bollobás and Scott conjectured that every graph __G__ has a bisection __H__ such that deg~__H__~(__v__) ≥ ⌊deg~__G__~(__v__)/2⌋ for all vertices __v__. We prove a degree sequence version of this conjecture: given a graphic sequen

Explicit Galois Realization of Transitiv

Explicit Galois Realization of Transitive Groups of Degree up to 15

✍ Jürgen Klüners; Gunter Malle 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 419 KB

We describe methods for the construction of polynomials with certain types of Galois groups. As an application we deduce that all transitive groups G up to degree 15 occur as Galois groups of regular extensions of Q(t), and in each case compute a polynomial f ∈ Q[x] with Gal(f ) = G.

Equitable list-coloring for graphs of ma

Equitable list-coloring for graphs of maximum degree 3

✍ Michael J. Pelsmajer 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract Given lists of available colors assigned to the vertices of a graph __G__, a list coloring is a proper coloring of __G__ such that the color on each vertex is chosen from its list. If the lists all have size __k__, then a list coloring is equitable if each color appears on at most ⌈|__V