One-three join: a graph operation and its consequences

DOI10.7151/DMGT.1948zbMATH Open1366.05089OpenAlexW2580031533MaRDI QIDQ2364085FDOQ2364085

Authors: 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

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

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

• Network flows. Theory, algorithms, and applications.
• Complement reducible graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The strong perfect graph theorem
• The structure of claw-free graphs
• Stable sets for (P_{6}, K_{2,3})-free graphs
• Complexity of graph partition problems
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
• Maximum weight independent sets in hole- and dart-free graphs
• On algorithms for (\(P_5\), gem)-free graphs
• List Partitions
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs
• Extending the MAX algorithm for maximum independent set
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Even-hole-free graphs part II: Recognition algorithm
• 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
• Odd Hole Recognition in Graphs of Bounded Clique Size
• On the complexity of testing for odd holes and induced odd paths

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)