Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-015-9972-9
@@ Property / DOI: 10.1007/s10878-015-9972-9 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6687843
@@ Property / zbMATH DE Number: 6687843 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+neighbourly sets
@@ Property / zbMATH Keywords: neighbourly sets / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+quadrilateral free graphs
@@ Property / zbMATH Keywords: quadrilateral free graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graphs without \(C_4\)
@@ Property / zbMATH Keywords: graphs without \(C_4\) / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithm
@@ Property / zbMATH Keywords: algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+strong edge colouring
@@ Property / zbMATH Keywords: strong edge colouring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+antimatching
@@ Property / zbMATH Keywords: antimatching / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3106104785
@@ Property / OpenAlex ID: W3106104785 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.8338
@@ Property / arXiv ID: 1412.8338 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+On Graphs that do not Contain a Thomsen Graph
@@ Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs without four-cycles
@@ Property / cites work: Graphs without four-cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q5771387
@@ Property / cites work: Q5771387 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5520566
@@ Property / cites work: Q5520566 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal graphs without 4-cycles
@@ Property / cites work: Extremal graphs without 4-cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4313189
@@ Property / cites work: Q4313189 / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal characterization of the incidence graphs of projective planes
+Normal rank
@@ Property / cites work @@
+Large Subgraphs without Short Cycles
@@ Property / cites work: Large Subgraphs without Short Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+The History of Degenerate (Bipartite) Extremal Graph Problems
+Normal rank
@@ Property / cites work @@
+Graphs without quadrilaterals
@@ Property / cites work: Graphs without quadrilaterals / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of edges of quadrilateral-free graphs
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Total colorings of degenerate graphs
@@ Property / cites work: Total colorings of degenerate graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of strong edge coloring
+Normal rank
@@ Property / cites work @@
+The maximum spectral radius of \(C_4\)-free graphs of given order and size
+Normal rank
@@ Property / cites work @@
+Über ein Problem von K. Zarankiewicz
@@ Property / cites work: Über ein Problem von K. Zarankiewicz / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-015-9972-9
@@ Property / DOI: 10.1007/S10878-015-9972-9 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:511689