Realizability of graphs as triangle cover contact graphs

DOI10.1016/J.TCS.2018.02.027MaRDI QIDQ1704579zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

realization problemcover contact graphtriangle cover contact graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Realizability of Graphs as Triangle Cover Contact Graphs
• On triangle cover contact graphs
• On triangle cover contact graphs
• Cover Contact Graphs
• Cover contact graphs

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• Cover contact graphs
• Moving coins
• On triangle cover contact graphs
• Realizability of Graphs as Triangle Cover Contact Graphs
• Representations by contact and intersection of segments

Cited in

(7)

• scientific article; zbMATH DE number 2100931 (Why is no real title available?)
• Cover Contact Graphs
• Cover contact graphs
• Graph-theoretical conditions for inscribability and Delaunay realizability
• Realizability of Graphs as Triangle Cover Contact Graphs
• On triangle cover contact graphs
• On triangle cover contact graphs

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)