On \(k\)-chromatically connected graphs (Q1045036): Difference between revisions

@@ Property / author @@
+Esmeralda L. Năstase
@@ Property / author: Esmeralda L. Năstase / rank @@
+Normal rank
@@ 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.disc.2008.03.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2039560145
@@ Property / OpenAlex ID: W2039560145 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic connectivity of graphs
@@ Property / cites work: The chromatic connectivity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
+Normal rank
@@ Property / cites work @@
+Q3872505
@@ Property / cites work: Q3872505 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4870157
@@ Property / cites work: Q4870157 / rank @@
+Normal rank