✦ LIBER ✦

Digraphs with maximum number of paths and cycles

✍ Scribed by Yehoshua Perl

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 482 KB
Volume: 17
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230170305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tools for studying paths and cycles in d

Tools for studying paths and cycles in digraphs

✍ Delorme, C.; Ordaz, O.; Quiroz, D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

The main goal of this work was to describe the basic elements constituting a specialized knowledge base in the field of paths and circuits in digraphs. This knowledge base contains commented on examples with textual and graphical descriptions, invariants, relations among invariants, and theorems. It

The Cycle-Path Indicator Polynomial of a

The Cycle-Path Indicator Polynomial of a Digraph

✍ Ottavio M. D'Antona; Emanuele Munarini 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 126 KB

A cycle-path cover of a digraph D is a spanning subgraph made of disjoint cycles and paths. In order to count such covers by types we introduce the cyclepath indicator polynomial of D. We show that this polynomial can be obtained by a deletion-contraction recurrence relation. Then we study some spec

On the maximum number of cycles in a pla

On the maximum number of cycles in a planar graph

✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib

The Square of Paths and Cycles

✍ G.H. Fan; H.A. Kierstead 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 388 KB

The square of a path (cycle) is the graph obtained by joining every pair of vertices of distance two in the path (cycle). Let $G$ be a graph on $n$ vertices with minimum degree $\delta(G)$. Posa conjectured that if $\delta(G) \geqslant \frac{2}{3} n$, then $G$ contains the square of a hami

On the Maximum Number of Independent Cyc

On the Maximum Number of Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Let G=(V 1 , V 2 ; E ) be a bipartite graph with |V 1 |= |V 2 | =n 2k, where k is a positive integer. Suppose that the minimum degree of G is at least k+1. We show that if n>2k, then G contains k vertex-disjoint cycles. We also show that if n=2k, then G contains k&1 quadrilaterals and a path of orde

Existence of Δλ-cycles and Δλ-paths

✍ H. J. Broersma 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 398 KB