Tree-core and tree-coritivity of graphs (Q2348704): Difference between revisions

@@ Property / author @@
-En-Qiang Zhu
@@ Property / author: En-Qiang Zhu / rank @@
-Normal rank
@@ Property / author @@
+En-Qiang Zhu
@@ Property / author: En-Qiang Zhu / 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.ipl.2015.02.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2037512951
@@ Property / OpenAlex ID: W2037512951 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529530
@@ Property / cites work: Q4529530 / rank @@
+Normal rank
@@ Property / cites work @@
+On unreliability polynomials and graph connectivity in reliable network synthesis
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1
+Normal rank
@@ Property / cites work @@
+Hamiltonian connectedness in claw-free graphs
@@ Property / cites work: Hamiltonian connectedness in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Connectivities, Network Coding, and Expander Graphs
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320671
@@ Property / cites work: Q4320671 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871072
@@ Property / cites work: Q4871072 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum induced trees in graphs
@@ Property / cites work: Maximum induced trees in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i>
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Vertex Connectivity of Graphs
@@ Property / cites work: Finding the Vertex Connectivity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Vertex Connectivity: New Bounds from Old Techniques
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Rupture degree of graphs
@@ Property / cites work: Rupture degree of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties
+Normal rank
@@ Property / cites work @@
+Q4203021
@@ Property / cites work: Q4203021 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2348704