Maximality of the cycle code of a graph

DOI10.1016/0012-365X(94)90132-5zbMath0794.05114MaRDI QIDQ1322205

Patrick Solé, Thomas Zaslavsky

Publication date: 28 August 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycle spacegirthcycle code

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

Complexity of circuit intersection in graphs ⋮ Unnamed Item ⋮ The covering radius of the cycle code of a graph

Cites Work

• Unnamed Item
• The covering radius of the cycle code of a graph
• Matching theory
• Conservative weightings and ear-decompositions of graphs
• Covering radius---Survey and recent results
• Graph theoretic error-correcting codes

This page was built for publication: Maximality of the cycle code of a graph