Dominating cliques in \(P_ 5\)-free graphs (Q1176051): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Star-cutsets and perfect graphs
@@ Property / cites work: Star-cutsets and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of two non-neighboring subgraphs in a graph
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Comparability Graph of a Tree
@@ Property / cites work: The Comparability Graph of a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating cliques in graphs
@@ Property / cites work: Dominating cliques in graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02352694
+Normal rank
@@ Property / OpenAlex ID @@
+W2030973065
@@ Property / OpenAlex ID: W2030973065 / rank @@
+Normal rank