One-three join: a graph operation and its consequences

DOI10.7151/DMGT.1948MaRDI QIDQ2364085zbMATH OpenOpenAlexFDO

Authors M. A. Shalu, S. Devi Yamini

Publication date 17 July 2017

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1948

zbMATH Keywords

homogeneous setbipartite-joinodd hole-free graphsone-three join

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• A generalization of join and an algorithmic recognition problem
• Combinatorial optimization with 2-joins
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
• Join colourings of chordal graphs
• On a \(k\)-clique-join of a class of partitionalble graphs

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
• Complement reducible graphs
• Complexity of graph partition problems
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Even-hole-free graphs part II: Recognition algorithm
• Extending the MAX algorithm for maximum independent set
• List Partitions
• Maximum weight independent sets in hole- and dart-free graphs
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull
• Network flows. Theory, algorithms, and applications.
• Odd Hole Recognition in Graphs of Bounded Clique Size
• On algorithms for (\(P_5\), gem)-free graphs
• On the complexity of testing for odd holes and induced odd paths
• Stable sets for (P_{6}, K_{2,3})-free graphs
• Substitution and \(\chi\)-boundedness
• The strong perfect graph theorem
• The structure of claw-free graphs
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs

Cited in

(1)

• A generalization of join and an algorithmic recognition problem

This page was built for publication: One-three join: a graph operation and its consequences

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