Self‐clique graphs and matrix permutations

DOI10.1002/JGT.10496MaRDI QIDQ4446891zbMATH OpenOpenAlexFDO

Authors Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme L. Szwarcfiter

Publication date 3 February 2004

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10533/174244

zbMATH Keywords

computational complexityclique graphself-clique graphclique-Helly graphpermuted matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• On self-clique graphs all of whose cliques have equal size.
• On self-clique graphs with given clique sizes. II
• On hereditary clique-Helly self-clique graphs
• A hierarchy of self-clique graphs
• scientific article; zbMATH DE number 2096440

Cites work

• scientific article; zbMATH DE number 553916 (Why is no real title available?)
• scientific article; zbMATH DE number 3993639 (Why is no real title available?)
• scientific article; zbMATH DE number 1409177 (Why is no real title available?)
• A characterization of clique graphs
• A partial characterization of clique graphs
• Complexity Results for Bandwidth Minimization
• Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
• On clique-critical graphs
• On self-clique graphs with given clique sizes
• Permuting matrices to avoid forbidden submatrices
• The NP-completeness of the bandwidth minimization problem

Cited in

(14)

• Split clique graph complexity
• Biclique graphs of interval bigraphs
• On self-clique shoal graphs
• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• Biclique-Helly graphs
• On self-clique graphs with given clique sizes. II
• A hierarchy of self-clique graphs
• Biclique graphs and biclique matrices
• On self-clique graphs with triangular cliques
• On hereditary clique-Helly self-clique graphs
• Self-clique Helly circular-arc graphs
• The complexity of clique graph recognition
• Symmetric games revisited
• Biclique graphs of split graphs

This page was built for publication: Self‐clique graphs and matrix permutations

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