On the isomorphism of graphs with few P4s

DOI10.1007/3-540-60618-1_63OpenAlexW1578704076MaRDI QIDQ6122208

Luitpold Babel, Stephan Olariu

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_63

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complement reducible graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• A New Class of Brittle Graphs
• A Linear Recognition Algorithm for Cographs
• Isomorphism Testing in Hookup Classes
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism

This page was built for publication: On the isomorphism of graphs with few P4s