✦ LIBER ✦

Maximal circuits of graphs. I

✍ Scribed by D. R. Woodall

Publisher: Akadmiai Kiad
Year: 1976
Tongue: English
Weight: 222 KB
Volume: 28
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01902497

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On maximal paths and circuits of graphs

✍ P. Erdős; T. Gallai 📂 Article 📅 1959 🏛 Akadmiai Kiad 🌐 English ⚖ 975 KB

Edge-maximal (k, i)-graphs

✍ Hong-Jian Lai; Cun-Quan Zhang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 550 KB

## Abstract A graph __G__ is a (__k, l__)‐graph if for any subgraph __H__ of __G__, that |__V(H)__| ≧ implies that k(__H__) ≦ __k__ − 1. An edge‐maximal (__k, l__‐graph __G__ is one such that for any __e__ ϵ __E__(__G__^__c__^), __G__ + __e__ is not a (__k, l__)‐graph. In [F. T. Boesch and J. A. M.

On the maximal number of independent cir

On the maximal number of independent circuits in a graph

✍ K. Corrádi; A. Hajnal 📂 Article 📅 1963 🏛 Akadmiai Kiad 🌐 English ⚖ 776 KB

On the maximal number of independent cir

On the maximal number of independent circuits in a graph

✍ G. Dirac; P. Erdõs 📂 Article 📅 1963 🏛 Akadmiai Kiad 🌐 English ⚖ 898 KB

The reconstruction of maximal planar gra

The reconstruction of maximal planar graphs. I. Recognition

✍ S Fiorini; J Lauri 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Interior graphs of maximal outerplane gr

Interior graphs of maximal outerplane graphs

✍ Sandra M Hedetniemi; Andrzej Proskurowski; Maciej M Sysło 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 631 KB