Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Recognizing hinge-free line graphs and total graphs

From MaRDI portal
Publication:1596464
Jump to:navigation, search

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

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



zbMATH Keywords

characterizationsline graphstotal graphs


Mathematics Subject Classification ID

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



Related Items (3)

Minimumk-geodetically connected digraphs ⋮ Towards minimumk-geodetically connected graphs ⋮ Some special minimum \(k\)-geodetically connected graphs






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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1596464&oldid=13892257"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 03:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki