Realizability of graphs as triangle cover contact graphs
DOI10.1016/J.TCS.2018.02.027zbMATH Open1390.05230OpenAlexW3022323614WikidataQ130162367 ScholiaQ130162367MaRDI QIDQ1704579FDOQ1704579
Authors: Shaheena Sultana, Md. Saidur Rahman
Publication date: 12 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.02.027
Recommendations
Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (7)
This page was built for publication: Realizability of graphs as triangle cover contact graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704579)