Finding a chain graph in a bipartite permutation graph

DOI10.1016/J.IPL.2016.04.006MaRDI QIDQ284350zbMATH OpenOpenAlexFDO

Authors Masashi Kiyomi, Yota Otachi

Publication date 18 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.04.006

zbMATH Keywords

graph algorithmsbipartite permutation graphchain graphsubgraph isomorphism

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 139780 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1156661 (Why is no real title available?)
• Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
• Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
• Subgraph isomorphism in graph classes

Cited in

(3)

• Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
• Labelled well-quasi-order for permutation classes
• Subgraph isomorphism on graph classes that exclude a substructure

This page was built for publication: Finding a chain graph in a bipartite permutation graph

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