On smallest regular graphs with a given isopart

DOI10.1002/JGT.3190090108zbMath0607.05039OpenAlexW2033181468MaRDI QIDQ3745866

John Frederick Fink

Publication date: 1985

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190090108

zbMATH Keywords

starstreecyclescomplete graphsedge-decompositionG-decompositionisopart

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (2)

A result on decompositions of regular graphs ⋮ Unnamed Item

Cites Work

• Every graph is an induced isopart of a circulant

This page was built for publication: On smallest regular graphs with a given isopart