Biclique graphs of K₃-free graphs and bipartite graphs

DOI10.1016/J.PROCS.2021.11.029MaRDI QIDQ6890900zbMATH OpenFDO

Authors Marina Esther Groshaus, André L. P. Guedes

Publication date 2 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2021.11.029

zbMATH Keywords

biclique graphsbicliquesbipartite graphscomparability graphsintersection graphspower of a graphtriangle-free graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Biclique graphs of \(K_3\)-free graphs and bipartite graphs

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