No graph has a maximal 3-ring of bonds

DOI10.1016/0095-8956(85)90079-6zbMath0567.05039OpenAlexW2017379100MaRDI QIDQ1059647

Charles H. C. Little, Derek Holton

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90079-6

zbMATH Keywords

characterizationbondsgraphs planarity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Rings of bonds in graphs

Cites Work

• On rigid circuit graphs
• Rings of bonds in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: No graph has a maximal 3-ring of bonds