Cycle structure of edge labelled graphs

DOI10.1016/0166-218X(93)90139-FzbMath0779.68068OpenAlexW2040364278MaRDI QIDQ686524

James S. Diamond, Alberto O. Mendelzon

Publication date: 2 December 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90139-f

zbMATH Keywords

matroid theoryedge deletioncyclic structure of graphs

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing the universal instance assumption
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Power of Natural Semijoins

This page was built for publication: Cycle structure of edge labelled graphs