Rings of bonds in graphs

DOI10.1016/0095-8956(82)90052-1zbMATH Open0477.05058OpenAlexW1969736728MaRDI QIDQ1160145FDOQ1160145

Derek Holton, C. H. C. Little

Publication date: 1982

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(82)90052-1

zbMATH Keywords

cyclic sequence of bonds

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• No graph has a maximal 3-ring of bonds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• No graph has a maximal 3-ring of bonds

This page was built for publication: Rings of bonds in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160145)