Recognition and isomorphism of proper H -graphs for unicyclic H in \textit{FPT}-time
From MaRDI portal
Publication:6575404
DOI10.1007/978-981-97-0566-5_22MaRDI QIDQ6575404FDOQ6575404
Authors: Deniz Ağaoğlu Çağırıcı, Peter Zeman 
Publication date: 19 July 2024
Cites Work
- A note on two problems in connexion with graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Isomorphism of graph classes related to the circular-ones property
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Finding Hamiltonian circuits in interval graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Graph isomorphism problem
- Precoloring extension. I: Interval graphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Extending partial representations of subclasses of chordal graphs
- Combinatorial problems on \(H\)-graphs
- Isomorphism testing for \(T\)-graphs in FPT
- Title not available (Why is that?)
- On \(H\)-topological intersection graphs
- Title not available (Why is that?)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Recognizing Proper Tree-Graphs
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
- Recognizing \(H\)-graphs -- beyond circular-arc graphs
This page was built for publication: Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575404)
