Recognizing hinge-free line graphs and total graphs

DOI10.11650/TWJM/1500574996zbMATH Open0995.05127OpenAlexW1603416547MaRDI QIDQ1596464FDOQ1596464

Authors: Jou-Ming Chang, Chin-Wen Ho 

Publication date: 22 May 2002

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500574996

Recommendations

• The recognition of geodetically connected graphs
• A linear time algorithm for finding all hinge vertices of a permutation graph
• The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs
• Chordless cycles in line graphs
• scientific article; zbMATH DE number 5711694

zbMATH Keywords

characterizationsline graphstotal graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75)

Cited In (4)

• Some special minimum \(k\)-geodetically connected graphs
• Minimumk-geodetically connected digraphs
• Generating hinges from arbitrary subhypergraphs
• Towards minimumk-geodetically connected graphs

This page was built for publication: Recognizing hinge-free line graphs and total graphs

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