Self‐clique graphs and matrix permutations
DOI10.1002/JGT.10496zbMATH Open1031.05115OpenAlexW2604724570MaRDI QIDQ4446891FDOQ4446891
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
Recommendations
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)
Cites Work
- On self-clique graphs with given clique sizes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The NP-completeness of the bandwidth minimization problem
- Complexity Results for Bandwidth Minimization
- Title not available (Why is that?)
- A partial characterization of clique graphs
- A characterization of clique graphs
- Permuting matrices to avoid forbidden submatrices
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- On clique-critical graphs
Cited In (14)
- Split clique graph complexity
- 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
- Biclique graphs of interval bigraphs
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)
