scientific article

zbMath0492.05039MaRDI QIDQ3953795

Peter Horák

Publication date: 1982

Full work available at URL: https://eudml.org/doc/34122

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Polya's enumeration theoremmaximal K-connected

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of dissimilar supergraphs of a linear graph
• On the number of bi-colored graphs
• A classification of 4-connected graphs
• Minimally 2-edge connected graphs
• Minimally 2-connected graphs.
• On Minimal Blocks

This page was built for publication: