One-three join: a graph operation and its consequences

DOI10.7151/dmgt.1948zbMath1366.05089OpenAlexW2580031533MaRDI QIDQ2364085

M. A. Shalu, S. Devi Yamini

Publication date: 17 July 2017

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
• Substitution and \(\chi\)-boundedness
• Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull
• Maximum weight independent sets in hole- and dart-free graphs
• On algorithms for (\(P_5\), gem)-free graphs
• The strong perfect graph theorem
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs
• Complement reducible graphs
• On the complexity of testing for odd holes and induced odd paths
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Extending the MAX algorithm for maximum independent set
• Complexity of graph partition problems
• Even-hole-free graphs part II: Recognition algorithm
• List Partitions
• Stable sets for (P_{6}, K_{2,3})-free graphs
• Odd Hole Recognition in Graphs of Bounded Clique Size

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