Cycle structure of edge labelled graphs

DOI10.1016/0166-218X(93)90139-FMaRDI QIDQ686524zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Degrees of acyclicity for hypergraphs and relational database schemes
• scientific article; zbMATH DE number 857453
• On the Desirability of Acyclic Database Schemes
• scientific article; zbMATH DE number 859448
• Paths and cycles of hypergraphs

Cites work

• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Power of Natural Semijoins
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Testing the universal instance assumption

Cited in

(1)

• scientific article; zbMATH DE number 4106890 (Why is no real title available?)

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

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