Triangle-free outerplanar 3-graphs are pairwise compatibility graphs

DOI10.7155/JGAA.00286zbMATH Open1260.05044OpenAlexW2212228244MaRDI QIDQ4910554FDOQ4910554

Authors: Sammi Abida Salma, Md. Saidur Rahman, M. I. 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

Recommendations

• Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
• Pairwise compatibility graphs: a survey
• Some classes of graphs that are not PCGs
• Exploring pairwise compatibility graphs
• A survey on pairwise compatibility graphs

zbMATH Keywords

pairwise compatibility graphtriangle-free outerplanar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (13)

• Some classes of graphs that are not PCGs
• Some reduction operations to pairwise compatibility graphs
• A survey on pairwise compatibility graphs
• On graphs that are not PCGs
• Characterizing star-PCGs
• Pairwise compatibility graphs: a survey
• New results on pairwise compatibility graphs
• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
• Multi-interval pairwise compatibility graphs (extended abstract)
• Exact-2-relation graphs
• On star-multi-interval pairwise compatibility graphs
• Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
• Pairwise compatibility graphs: complete characterization for wheels

This page was built for publication: Triangle-free outerplanar 3-graphs are pairwise compatibility graphs

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