Algorithm for identifying (2,2)-bipartite graphs

DOI10.17654/DM017040397MaRDI QIDQ2968224zbMATH OpenFDO

Authors K. Manjunatha Prasad, K. V. Soumya, G. Sudhakara

Publication date 10 March 2017

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/DM017040397

zbMATH Keywords

\((2,2)\)-bipartite graphs\((2,2)\)-colorable graphdistance-\(k\) graph \(G_k\)neighborhood of a vertex

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Bipartite bithreshold graphs
• Algorithmic aspects of bipartite graphs
• 2-split graphs
• scientific article; zbMATH DE number 4087718
• The edge-cochromatic number of bipartite graph

Cited in

(2)

• Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
• scientific article; zbMATH DE number 1522753 (Why is no real title available?)

This page was built for publication: Algorithm for identifying \((2,2)\)-bipartite graphs

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