Cycle structure of edge labelled graphs
DOI10.1016/0166-218X(93)90139-FzbMATH Open0779.68068OpenAlexW2040364278MaRDI QIDQ686524FDOQ686524
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Title not available (Why is that?)
- Power of Natural Semijoins
- Testing the universal instance assumption
Cited In (1)
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)