Eine Eigenschaft der Atome endlicher Graphen

DOI10.1007/BF01222585zbMath0201.56802MaRDI QIDQ5921020

W. Mader

Publication date: 1971

Published in: Archiv der Mathematik (Search for Journal in Brave)

Related Items (22)

An upper bound for orders of certain \((k,\bar k)\)-connected graphs ⋮ Critically \((k,k)\)-connected graphs ⋮ Sur les atomes d'un graphe de Cayley infini. (On the atoms of an infinite Cayley graph) ⋮ Generalizaions of critical connectivity of graphs ⋮ The complexity of recognizing minimally tough graphs ⋮ On the existence of \((k,l)\)-critical graphs ⋮ Small cutsets in quasiminimal Cayley graphs ⋮ Properties of minimally \(t\)-tough graphs ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ The structure of minimally \(t\)-tough, \(2K_2\)-free graphs ⋮ Connectivity of the Mycielskian of a graph ⋮ On critically h-connected simple graphs ⋮ On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs ⋮ On a conjecture of Entringer and Slater ⋮ The connectivity of hierarchical Cayley digraphs ⋮ Contractible edges in 7-connected graphs ⋮ Extremal infinite graph theory ⋮ Factorisations courtes dans un groupe fini. (Short factorizations in a finite group) ⋮ A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Sur la séparation dans les graphes de Cayley abéliens ⋮ A generalisation to noncommutative groups of a theorem of Mann

Cites Work

• A theorem on n-connected graphs
• Connectivity of transitive graphs

This page was built for publication: Eine Eigenschaft der Atome endlicher Graphen