A unified approach to recognize squares of split graphs (Q313959): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.07.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2181963588
@@ Property / OpenAlex ID: W2181963588 / rank @@
+Normal rank
@@ Property / cites work @@
+Probe threshold and probe trivially perfect graphs
+Normal rank
@@ Property / cites work @@
+On balanced graphs
@@ Property / cites work: On balanced graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of balanced matrices
@@ Property / cites work: Decomposition of balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity aspects of the Helly property: graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Split Graphs Having Dilworth Number Two
@@ Property / cites work: Split Graphs Having Dilworth Number Two / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Powers of Proper Interval, Split, and Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
+Normal rank
@@ Property / cites work @@
+Hardness Results and Efficient Algorithms for Graph Powers
+Normal rank
@@ Property / cites work @@
+A good characterization of squares of strongly chordal split graphs
+Normal rank
@@ Property / cites work @@
+Arboricity, \(h\)-index, and dynamic algorithms
@@ Property / cites work: Arboricity, \(h\)-index, and dynamic algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Computing square roots of trivially perfect and threshold graphs
+Normal rank
@@ Property / cites work @@
+Computing roots of graphs is hard
@@ Property / cites work: Computing roots of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288086
@@ Property / cites work: Q4288086 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:313959