Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs
From MaRDI portal
Publication:4910554
DOI10.7155/jgaa.00286zbMath1260.05044OpenAlexW2212228244MaRDI QIDQ4910554
Sammi Abida Salma, Md. Saidur Rahman, Md. Iqbal Hossain
Publication date: 19 March 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00286
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (12)
Pairwise Compatibility Graphs: A Survey ⋮ New results on pairwise compatibility graphs ⋮ On star-multi-interval pairwise compatibility graphs ⋮ Pairwise compatibility graphs: complete characterization for wheels ⋮ Exact-2-relation graphs ⋮ Multi-interval Pairwise Compatibility Graphs ⋮ Some classes of graphs that are not PCGs ⋮ Characterizing star-PCGs ⋮ On graphs that are not PCGs ⋮ A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs ⋮ Some reduction operations to pairwise compatibility graphs ⋮ A survey on pairwise compatibility graphs
This page was built for publication: Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs