[https://portal.mardi4nfdi.de/wiki/Person:705885 U. S. R. Murty], [https://portal.mardi4nfdi.de/wiki/Person:967301 J. A. Bondy] table#1 { ["head"] = table#2 { ["vars"] = table#3 { "subjectLabel", "itemType", [0] = "subject", }, }, ["results"] = table#4 { ["bindings"] = table#5 { table#6 { ["itemType"] = table#7 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q595688", }, ["subjectLabel"] = table#9 { ["type"] = "literal", ["value"] = "Regular subgraphs of almost regular graphs", ["xml:lang"] = "en", }, }, table#10 { ["itemType"] = table#11 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#12 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q601948", }, ["subjectLabel"] = table#13 { ["type"] = "literal", ["value"] = "Some results on spanning trees", ["xml:lang"] = "en", }, }, table#14 { ["itemType"] = table#15 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#16 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q602680", }, ["subjectLabel"] = table#17 { ["type"] = "literal", ["value"] = "The smallest values of algebraic connectivity for unicyclic graphs", ["xml:lang"] = "en", }, }, table#18 { ["itemType"] = table#19 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#20 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q604055", }, ["subjectLabel"] = table#21 { ["type"] = "literal", ["value"] = "On the chromatic number of integral circulant graphs", ["xml:lang"] = "en", }, }, table#22 { ["itemType"] = table#23 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#24 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q406335", }, ["subjectLabel"] = table#25 { ["type"] = "literal", ["value"] = "Paths and animals in infinite graphs with tempered degree growth", ["xml:lang"] = "en", }, }, table#26 { ["itemType"] = table#27 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#28 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q408370", }, ["subjectLabel"] = table#29 { ["type"] = "literal", ["value"] = "Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices", ["xml:lang"] = "en", }, }, table#30 { ["itemType"] = table#31 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#32 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q410007", }, ["subjectLabel"] = table#33 { ["type"] = "literal", ["value"] = "Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number", ["xml:lang"] = "en", }, }, table#34 { ["itemType"] = table#35 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#36 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q424181", }, ["subjectLabel"] = table#37 { ["type"] = "literal", ["value"] = "A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs", ["xml:lang"] = "en", }, }, table#38 { ["itemType"] = table#39 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#40 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q426602", }, ["subjectLabel"] = table#41 { ["type"] = "literal", ["value"] = "Bipanconnectivity of faulty hypercubes with minimum degree", ["xml:lang"] = "en", }, }, table#42 { ["itemType"] = table#43 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#44 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q429644", }, ["subjectLabel"] = table#45 { ["type"] = "literal", ["value"] = "On zeroth-order general Randić index of quasi-tree graphs containing cycles", ["xml:lang"] = "en", }, }, table#46 { ["itemType"] = table#47 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#48 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q434226", }, ["subjectLabel"] = table#49 { ["type"] = "literal", ["value"] = "An Erdős-Gallai theorem for matroids", ["xml:lang"] = "en", }, }, table#50 { ["itemType"] = table#51 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#52 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q443723", }, ["subjectLabel"] = table#53 { ["type"] = "literal", ["value"] = "New techniques for approximating optimal substructure problems in power-law graphs", ["xml:lang"] = "en", }, }, table#54 { ["itemType"] = table#55 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#56 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q448275", }, ["subjectLabel"] = table#57 { ["type"] = "literal", ["value"] = "Exponential stabilization of variable coefficient wave equations in a generic tree with small time-delays in the nodal feedbacks", ["xml:lang"] = "en", }, }, table#58 { ["itemType"] = table#59 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#60 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q452818", }, ["subjectLabel"] = table#61 { ["type"] = "literal", ["value"] = "Three notions of tropical rank for symmetric matrices", ["xml:lang"] = "en", }, }, table#62 { ["itemType"] = table#63 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#64 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q461444", }, ["subjectLabel"] = table#65 { ["type"] = "literal", ["value"] = "On the computational complexity of membership problems for the completely positive cone and its dual", ["xml:lang"] = "en", }, }, table#66 { ["itemType"] = table#67 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#68 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q461727", }, ["subjectLabel"] = table#69 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows and modulo \$k\$-orientations", ["xml:lang"] = "en", }, }, table#70 { ["itemType"] = table#71 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#72 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q467294", }, ["subjectLabel"] = table#73 { ["type"] = "literal", ["value"] = "Eulerian digraphs and toric Calabi-Yau varieties", ["xml:lang"] = "en", }, }, table#74 { ["itemType"] = table#75 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#76 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q472135", }, ["subjectLabel"] = table#77 { ["type"] = "literal", ["value"] = "An implicit weighted degree condition for heavy cycles", ["xml:lang"] = "en", }, }, table#78 { ["itemType"] = table#79 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#80 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q473099", }, ["subjectLabel"] = table#81 { ["type"] = "literal", ["value"] = "Strongly 2-connected orientations of graphs", ["xml:lang"] = "en", }, }, table#82 { ["itemType"] = table#83 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#84 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q475814", }, ["subjectLabel"] = table#85 { ["type"] = "literal", ["value"] = "Minimum total coloring of planar graph", ["xml:lang"] = "en", }, }, table#86 { ["itemType"] = table#87 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#88 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q476317", }, ["subjectLabel"] = table#89 { ["type"] = "literal", ["value"] = "Delta-wye reduction of almost-planar graphs", ["xml:lang"] = "en", }, }, table#90 { ["itemType"] = table#91 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#92 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q477256", }, ["subjectLabel"] = table#93 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz", ["xml:lang"] = "en", }, }, table#94 { ["itemType"] = table#95 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#96 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q477487", }, ["subjectLabel"] = table#97 { ["type"] = "literal", ["value"] = "A note on the existence of fractional \$f\$-factors in random graphs", ["xml:lang"] = "en", }, }, table#98 { ["itemType"] = table#99 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q477510", }, ["subjectLabel"] = table#101 { ["type"] = "literal", ["value"] = "Bipartite graphs with the maximum sum of squares of degrees", ["xml:lang"] = "en", }, }, table#102 { ["itemType"] = table#103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q477591", }, ["subjectLabel"] = table#105 { ["type"] = "literal", ["value"] = "A fixed-parameter algorithm for the vertex cover \$P_3\$ problem", ["xml:lang"] = "en", }, }, table#106 { ["itemType"] = table#107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q477634", }, ["subjectLabel"] = table#109 { ["type"] = "literal", ["value"] = "A sufficient condition involving implicit degree and neighborhood intersection for long cycles", ["xml:lang"] = "en", }, }, table#110 { ["itemType"] = table#111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q477743", }, ["subjectLabel"] = table#113 { ["type"] = "literal", ["value"] = "The inertia and energy of the distance matrix of a connected graph", ["xml:lang"] = "en", }, }, table#114 { ["itemType"] = table#115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q480403", }, ["subjectLabel"] = table#117 { ["type"] = "literal", ["value"] = "A graph associated to a lattice", ["xml:lang"] = "en", }, }, table#118 { ["itemType"] = table#119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q484318", }, ["subjectLabel"] = table#121 { ["type"] = "literal", ["value"] = "Some sufficient conditions for 1-planar graphs to be class 1", ["xml:lang"] = "en", }, }, table#122 { ["itemType"] = table#123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q486397", }, ["subjectLabel"] = table#125 { ["type"] = "literal", ["value"] = "An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem", ["xml:lang"] = "en", }, }, table#126 { ["itemType"] = table#127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489128", }, ["subjectLabel"] = table#129 { ["type"] = "literal", ["value"] = "Extreme tenacity of graphs with given order and size", ["xml:lang"] = "en", }, }, table#130 { ["itemType"] = table#131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489329", }, ["subjectLabel"] = table#133 { ["type"] = "literal", ["value"] = "Contractible edges in \$k\$-connected graphs with some forbidden subgraphs", ["xml:lang"] = "en", }, }, table#134 { ["itemType"] = table#135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489330", }, ["subjectLabel"] = table#137 { ["type"] = "literal", ["value"] = "Graphic sequences with an \$A\$-connected realization", ["xml:lang"] = "en", }, }, table#138 { ["itemType"] = table#139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489355", }, ["subjectLabel"] = table#141 { ["type"] = "literal", ["value"] = "The largest demigenus over all signatures on \$K_{3,n}\$", ["xml:lang"] = "en", }, }, table#142 { ["itemType"] = table#143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489359", }, ["subjectLabel"] = table#145 { ["type"] = "literal", ["value"] = "On traceable line graphs", ["xml:lang"] = "en", }, }, table#146 { ["itemType"] = table#147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489362", }, ["subjectLabel"] = table#149 { ["type"] = "literal", ["value"] = "The removable edges and the contractible subgraphs of 5-connected graphs", ["xml:lang"] = "en", }, }, table#150 { ["itemType"] = table#151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489367", }, ["subjectLabel"] = table#153 { ["type"] = "literal", ["value"] = "The minimal number of subtrees with a given degree sequence", ["xml:lang"] = "en", }, }, table#154 { ["itemType"] = table#155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q489710", }, ["subjectLabel"] = table#157 { ["type"] = "literal", ["value"] = "Notes on \$L(1,1)\$ and \$L(2,1)\$ labelings for \$n\$-cube", ["xml:lang"] = "en", }, }, table#158 { ["itemType"] = table#159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q490252", }, ["subjectLabel"] = table#161 { ["type"] = "literal", ["value"] = "The Ramsey numbers of paths versus wheels: a complete solution", ["xml:lang"] = "en", }, }, table#162 { ["itemType"] = table#163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q494432", }, ["subjectLabel"] = table#165 { ["type"] = "literal", ["value"] = "Collapsible graphs and Hamilton cycles of line graphs", ["xml:lang"] = "en", }, }, table#166 { ["itemType"] = table#167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q496265", }, ["subjectLabel"] = table#169 { ["type"] = "literal", ["value"] = "Tetracyclic graphs with extremal values of Randić index", ["xml:lang"] = "en", }, }, table#170 { ["itemType"] = table#171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497128", }, ["subjectLabel"] = table#173 { ["type"] = "literal", ["value"] = "The 2-path-bipanconnectivity of hypercubes", ["xml:lang"] = "en", }, }, table#174 { ["itemType"] = table#175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497228", }, ["subjectLabel"] = table#177 { ["type"] = "literal", ["value"] = "Hamiltonian properties of honeycomb meshes", ["xml:lang"] = "en", }, }, table#178 { ["itemType"] = table#179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497258", }, ["subjectLabel"] = table#181 { ["type"] = "literal", ["value"] = "A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs", ["xml:lang"] = "en", }, }, table#182 { ["itemType"] = table#183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497348", }, ["subjectLabel"] = table#185 { ["type"] = "literal", ["value"] = "Group chromatic number of Halin graphs", ["xml:lang"] = "en", }, }, table#186 { ["itemType"] = table#187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497349", }, ["subjectLabel"] = table#189 { ["type"] = "literal", ["value"] = "Generalizing vertex pancyclic and \$k\$-ordered graphs", ["xml:lang"] = "en", }, }, table#190 { ["itemType"] = table#191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497353", }, ["subjectLabel"] = table#193 { ["type"] = "literal", ["value"] = "A structural approach for independent domination of regular graphs", ["xml:lang"] = "en", }, }, table#194 { ["itemType"] = table#195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497372", }, ["subjectLabel"] = table#197 { ["type"] = "literal", ["value"] = "Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length", ["xml:lang"] = "en", }, }, table#198 { ["itemType"] = table#199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497376", }, ["subjectLabel"] = table#201 { ["type"] = "literal", ["value"] = "Total coloring of planar graphs without chordal short cycles", ["xml:lang"] = "en", }, }, table#202 { ["itemType"] = table#203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497381", }, ["subjectLabel"] = table#205 { ["type"] = "literal", ["value"] = "An improved upper bound on edge weight choosability of graphs", ["xml:lang"] = "en", }, }, table#206 { ["itemType"] = table#207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497382", }, ["subjectLabel"] = table#209 { ["type"] = "literal", ["value"] = "Coloring the square of Sierpiński graphs", ["xml:lang"] = "en", }, }, table#210 { ["itemType"] = table#211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q497932", }, ["subjectLabel"] = table#213 { ["type"] = "literal", ["value"] = "Construction of optimal independent spanning trees on folded hypercubes", ["xml:lang"] = "en", }, }, table#214 { ["itemType"] = table#215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q498415", }, ["subjectLabel"] = table#217 { ["type"] = "literal", ["value"] = "Some results on the reciprocal sum-degree distance of graphs", ["xml:lang"] = "en", }, }, table#218 { ["itemType"] = table#219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q498422", }, ["subjectLabel"] = table#221 { ["type"] = "literal", ["value"] = "Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications", ["xml:lang"] = "en", }, }, table#222 { ["itemType"] = table#223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q498443", }, ["subjectLabel"] = table#225 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings of planar graphs", ["xml:lang"] = "en", }, }, table#226 { ["itemType"] = table#227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q498491", }, ["subjectLabel"] = table#229 { ["type"] = "literal", ["value"] = "Topological chirality of a type of DNA and protein polyhedral links", ["xml:lang"] = "en", }, }, table#230 { ["itemType"] = table#231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q499166", }, ["subjectLabel"] = table#233 { ["type"] = "literal", ["value"] = "Some extremal results on the connective eccentricity index of graphs", ["xml:lang"] = "en", }, }, table#234 { ["itemType"] = table#235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q499817", }, ["subjectLabel"] = table#237 { ["type"] = "literal", ["value"] = "On evenly-equitable, balanced edge-colorings and related notions", ["xml:lang"] = "en", }, }, table#238 { ["itemType"] = table#239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q501028", }, ["subjectLabel"] = table#241 { ["type"] = "literal", ["value"] = "Adjacent vertex distinguishing colorings by sum of sparse graphs", ["xml:lang"] = "en", }, }, table#242 { ["itemType"] = table#243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q503617", }, ["subjectLabel"] = table#245 { ["type"] = "literal", ["value"] = "Snarks, hypohamiltonian graphs and non-supereulerian graphs", ["xml:lang"] = "en", }, }, table#246 { ["itemType"] = table#247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q505462", }, ["subjectLabel"] = table#249 { ["type"] = "literal", ["value"] = "A note on neighbor expanded sum distinguishing index", ["xml:lang"] = "en", }, }, table#250 { ["itemType"] = table#251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q506323", }, ["subjectLabel"] = table#253 { ["type"] = "literal", ["value"] = "Reliability analysis of bijective connection networks in terms of the extra edge-connectivity", ["xml:lang"] = "en", }, }, table#254 { ["itemType"] = table#255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q507331", }, ["subjectLabel"] = table#257 { ["type"] = "literal", ["value"] = "Nash equilibria in the two-player kidney exchange game", ["xml:lang"] = "en", }, }, table#258 { ["itemType"] = table#259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q507685", }, ["subjectLabel"] = table#261 { ["type"] = "literal", ["value"] = "Teichmüller curves in genus three and just likely intersections in \$\\mathbf{G}_{m}^{n}\\times\\mathbf{G}_{a}^{n}\$", ["xml:lang"] = "en", }, }, table#262 { ["itemType"] = table#263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q508679", }, ["subjectLabel"] = table#265 { ["type"] = "literal", ["value"] = "Edge-fault-tolerant pancyclicity of arrangement graphs", ["xml:lang"] = "en", }, }, table#266 { ["itemType"] = table#267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q511097", }, ["subjectLabel"] = table#269 { ["type"] = "literal", ["value"] = "Ordering graphs with cut edges by their spectral radii", ["xml:lang"] = "en", }, }, table#270 { ["itemType"] = table#271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q511730", }, ["subjectLabel"] = table#273 { ["type"] = "literal", ["value"] = "The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles", ["xml:lang"] = "en", }, }, table#274 { ["itemType"] = table#275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q512532", }, ["subjectLabel"] = table#277 { ["type"] = "literal", ["value"] = "Matching extension in prism graphs", ["xml:lang"] = "en", }, }, table#278 { ["itemType"] = table#279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q512884", }, ["subjectLabel"] = table#281 { ["type"] = "literal", ["value"] = "Neighbor product distinguishing total colorings", ["xml:lang"] = "en", }, }, table#282 { ["itemType"] = table#283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q512886", }, ["subjectLabel"] = table#285 { ["type"] = "literal", ["value"] = "Total coloring of planar graphs without adjacent short cycles", ["xml:lang"] = "en", }, }, table#286 { ["itemType"] = table#287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q512891", }, ["subjectLabel"] = table#289 { ["type"] = "literal", ["value"] = "On \$(p,1)\$-total labelling of planar graphs", ["xml:lang"] = "en", }, }, table#290 { ["itemType"] = table#291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q514827", }, ["subjectLabel"] = table#293 { ["type"] = "literal", ["value"] = "On the number of Laplacian eigenvalues of trees smaller than two", ["xml:lang"] = "en", }, }, table#294 { ["itemType"] = table#295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q516880", }, ["subjectLabel"] = table#297 { ["type"] = "literal", ["value"] = "On 2-distance coloring of plane graphs with girth 5", ["xml:lang"] = "en", }, }, table#298 { ["itemType"] = table#299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q517764", }, ["subjectLabel"] = table#301 { ["type"] = "literal", ["value"] = "Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs", ["xml:lang"] = "en", }, }, table#302 { ["itemType"] = table#303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q519907", }, ["subjectLabel"] = table#305 { ["type"] = "literal", ["value"] = "The behavior of clique-width under graph operations and graph transformations", ["xml:lang"] = "en", }, }, table#306 { ["itemType"] = table#307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q520529", }, ["subjectLabel"] = table#309 { ["type"] = "literal", ["value"] = "A totally \$(\\Delta + 1)\$-colorable 1-planar graph with girth at least five", ["xml:lang"] = "en", }, }, table#310 { ["itemType"] = table#311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q520904", }, ["subjectLabel"] = table#313 { ["type"] = "literal", ["value"] = "Jaco-type graphs and black energy dissipation", ["xml:lang"] = "en", }, }, table#314 { ["itemType"] = table#315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q521765", }, ["subjectLabel"] = table#317 { ["type"] = "literal", ["value"] = "A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs", ["xml:lang"] = "en", }, }, table#318 { ["itemType"] = table#319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q523715", }, ["subjectLabel"] = table#321 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing edge coloring of subcubic graphs", ["xml:lang"] = "en", }, }, table#322 { ["itemType"] = table#323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q523723", }, ["subjectLabel"] = table#325 { ["type"] = "literal", ["value"] = "Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs", ["xml:lang"] = "en", }, }, table#326 { ["itemType"] = table#327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q523764", }, ["subjectLabel"] = table#329 { ["type"] = "literal", ["value"] = "Pentavalent symmetric graphs of order 16p", ["xml:lang"] = "en", }, }, table#330 { ["itemType"] = table#331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q523775", }, ["subjectLabel"] = table#333 { ["type"] = "literal", ["value"] = "Up-embeddability of graphs with new degree-sum", ["xml:lang"] = "en", }, }, table#334 { ["itemType"] = table#335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q524658", }, ["subjectLabel"] = table#337 { ["type"] = "literal", ["value"] = "On Aharonov-Bohm operators with two colliding poles", ["xml:lang"] = "en", }, }, table#338 { ["itemType"] = table#339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q527179", }, ["subjectLabel"] = table#341 { ["type"] = "literal", ["value"] = "Some conditional vertex connectivities of complete-transposition graphs", ["xml:lang"] = "en", }, }, table#342 { ["itemType"] = table#343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q528553", }, ["subjectLabel"] = table#345 { ["type"] = "literal", ["value"] = "\$k\$-circular matroids of graphs", ["xml:lang"] = "en", }, }, table#346 { ["itemType"] = table#347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q534332", }, ["subjectLabel"] = table#349 { ["type"] = "literal", ["value"] = "Generalization of matching extensions in graphs. III", ["xml:lang"] = "en", }, }, table#350 { ["itemType"] = table#351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q539347", }, ["subjectLabel"] = table#353 { ["type"] = "literal", ["value"] = "Graph invariants and large cycles: a survey", ["xml:lang"] = "en", }, }, table#354 { ["itemType"] = table#355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q539352", }, ["subjectLabel"] = table#357 { ["type"] = "literal", ["value"] = "Equitable coloring on total graph of bigraphs and central graph of cycles and paths", ["xml:lang"] = "en", }, }, table#358 { ["itemType"] = table#359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q541476", }, ["subjectLabel"] = table#361 { ["type"] = "literal", ["value"] = "Genetic algorithm for combinatorial path planning: the subtour problem", ["xml:lang"] = "en", }, }, table#362 { ["itemType"] = table#363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q546315", }, ["subjectLabel"] = table#365 { ["type"] = "literal", ["value"] = "Removable edges in cycles of a \$k\$-connected graph", ["xml:lang"] = "en", }, }, table#366 { ["itemType"] = table#367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q550040", }, ["subjectLabel"] = table#369 { ["type"] = "literal", ["value"] = "On the Hosoya index of graphs", ["xml:lang"] = "en", }, }, table#370 { ["itemType"] = table#371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q551543", }, ["subjectLabel"] = table#373 { ["type"] = "literal", ["value"] = "A constraint graph representation of metamorphic linkages", ["xml:lang"] = "en", }, }, table#374 { ["itemType"] = table#375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q556838", }, ["subjectLabel"] = table#377 { ["type"] = "literal", ["value"] = "Completion of Laplacian integral graphs via edge addition", ["xml:lang"] = "en", }, }, table#378 { ["itemType"] = table#379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q578941", }, ["subjectLabel"] = table#381 { ["type"] = "literal", ["value"] = "A time bound on the materialization of some recursively defined views", ["xml:lang"] = "en", }, }, table#382 { ["itemType"] = table#383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q580348", }, ["subjectLabel"] = table#385 { ["type"] = "literal", ["value"] = "The regular matroids with no 5-wheel minor", ["xml:lang"] = "en", }, }, table#386 { ["itemType"] = table#387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q580365", }, ["subjectLabel"] = table#389 { ["type"] = "literal", ["value"] = "Largest induced subgraphs of the n-cube that contain no 4-cycles", ["xml:lang"] = "en", }, }, table#390 { ["itemType"] = table#391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q580376", }, ["subjectLabel"] = table#393 { ["type"] = "literal", ["value"] = "The binding number of a graph and its pancyclism", ["xml:lang"] = "en", }, }, table#394 { ["itemType"] = table#395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q581411", }, ["subjectLabel"] = table#397 { ["type"] = "literal", ["value"] = "On the genus and thickness of graphs", ["xml:lang"] = "en", }, }, table#398 { ["itemType"] = table#399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q583774", }, ["subjectLabel"] = table#401 { ["type"] = "literal", ["value"] = "Maximum sum-of-splits clustering", ["xml:lang"] = "en", }, }, table#402 { ["itemType"] = table#403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1076041", }, ["subjectLabel"] = table#405 { ["type"] = "literal", ["value"] = "n-connectedness in pure 2-complexes", ["xml:lang"] = "en", }, }, table#406 { ["itemType"] = table#407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1077427", }, ["subjectLabel"] = table#409 { ["type"] = "literal", ["value"] = "On Tutte polynomials and cycles of plane graphs", ["xml:lang"] = "en", }, }, table#410 { ["itemType"] = table#411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1077435", }, ["subjectLabel"] = table#413 { ["type"] = "literal", ["value"] = "Hypomorphisms, orbits, and reconstruction", ["xml:lang"] = "en", }, }, table#414 { ["itemType"] = table#415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1078194", }, ["subjectLabel"] = table#417 { ["type"] = "literal", ["value"] = "Regular subgraphs of dense graphs", ["xml:lang"] = "en", }, }, table#418 { ["itemType"] = table#419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1080438", }, ["subjectLabel"] = table#421 { ["type"] = "literal", ["value"] = "On k-leaf-connected graphs", ["xml:lang"] = "en", }, }, table#422 { ["itemType"] = table#423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1084870", }, ["subjectLabel"] = table#425 { ["type"] = "literal", ["value"] = "Graph theoretic closure properties of the family of boundary NLC graph languages", ["xml:lang"] = "en", }, }, table#426 { ["itemType"] = table#427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1085167", }, ["subjectLabel"] = table#429 { ["type"] = "literal", ["value"] = "A unified approach to visibility representations of planar graphs", ["xml:lang"] = "en", }, }, table#430 { ["itemType"] = table#431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1085183", }, ["subjectLabel"] = table#433 { ["type"] = "literal", ["value"] = "A cycle structure theorem for Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#434 { ["itemType"] = table#435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1088883", }, ["subjectLabel"] = table#437 { ["type"] = "literal", ["value"] = "Nowhere-zero integral chains and flows in bidirected graphs", ["xml:lang"] = "en", }, }, table#438 { ["itemType"] = table#439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1088989", }, ["subjectLabel"] = table#441 { ["type"] = "literal", ["value"] = "Designs with mutually orthogonal resolutions", ["xml:lang"] = "en", }, }, table#442 { ["itemType"] = table#443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1096650", }, ["subjectLabel"] = table#445 { ["type"] = "literal", ["value"] = "A generalization of a result of Häggkvist and Nicoghossian", ["xml:lang"] = "en", }, }, table#446 { ["itemType"] = table#447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1097285", }, ["subjectLabel"] = table#449 { ["type"] = "literal", ["value"] = "The binding number of a graph and its circuits", ["xml:lang"] = "en", }, }, table#450 { ["itemType"] = table#451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1097687", }, ["subjectLabel"] = table#453 { ["type"] = "literal", ["value"] = "Data transfers in networks", ["xml:lang"] = "en", }, }, table#454 { ["itemType"] = table#455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1098271", }, ["subjectLabel"] = table#457 { ["type"] = "literal", ["value"] = "An efficient algorithm for multiprocessor fault diagnosis using the comparison approach", ["xml:lang"] = "en", }, }, table#458 { ["itemType"] = table#459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1099188", }, ["subjectLabel"] = table#461 { ["type"] = "literal", ["value"] = "On the Hamiltonian index", ["xml:lang"] = "en", }, }, table#462 { ["itemType"] = table#463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1099191", }, ["subjectLabel"] = table#465 { ["type"] = "literal", ["value"] = "The binding number of a graph and its triangle", ["xml:lang"] = "en", }, }, table#466 { ["itemType"] = table#467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1101027", }, ["subjectLabel"] = table#469 { ["type"] = "literal", ["value"] = "On a pursuit game played on graphs for which a minor is excluded", ["xml:lang"] = "en", }, }, table#470 { ["itemType"] = table#471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1101114", }, ["subjectLabel"] = table#473 { ["type"] = "literal", ["value"] = "Short cocircuits in binary matroids", ["xml:lang"] = "en", }, }, table#474 { ["itemType"] = table#475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1101116", }, ["subjectLabel"] = table#477 { ["type"] = "literal", ["value"] = "Isotropic systems", ["xml:lang"] = "en", }, }, table#478 { ["itemType"] = table#479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1102221", }, ["subjectLabel"] = table#481 { ["type"] = "literal", ["value"] = "Simulation of cellular compaction and internalization in mammalian embryo development. II: Models for spherical embryos", ["xml:lang"] = "en", }, }, table#482 { ["itemType"] = table#483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1104345", }, ["subjectLabel"] = table#485 { ["type"] = "literal", ["value"] = "On well-quasi-ordering-finite graphs by immersion", ["xml:lang"] = "en", }, }, table#486 { ["itemType"] = table#487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1105385", }, ["subjectLabel"] = table#489 { ["type"] = "literal", ["value"] = "The general maximum matching algorithm of Micali and Vazirani", ["xml:lang"] = "en", }, }, table#490 { ["itemType"] = table#491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1105622", }, ["subjectLabel"] = table#493 { ["type"] = "literal", ["value"] = "Graph homomorphisms into the five-cycle", ["xml:lang"] = "en", }, }, table#494 { ["itemType"] = table#495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1106860", }, ["subjectLabel"] = table#497 { ["type"] = "literal", ["value"] = "Toughness and the existence of k-factors. II", ["xml:lang"] = "en", }, }, table#498 { ["itemType"] = table#499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1107545", }, ["subjectLabel"] = table#501 { ["type"] = "literal", ["value"] = "Matching extension and the genus of a graph", ["xml:lang"] = "en", }, }, table#502 { ["itemType"] = table#503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1110342", }, ["subjectLabel"] = table#505 { ["type"] = "literal", ["value"] = "A linear-processor algorithm for depth-first search in planar graphs", ["xml:lang"] = "en", }, }, table#506 { ["itemType"] = table#507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1112066", }, ["subjectLabel"] = table#509 { ["type"] = "literal", ["value"] = "Class one graphs", ["xml:lang"] = "en", }, }, table#510 { ["itemType"] = table#511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1112847", }, ["subjectLabel"] = table#513 { ["type"] = "literal", ["value"] = "Two classes of perfect graphs", ["xml:lang"] = "en", }, }, table#514 { ["itemType"] = table#515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q973415", }, ["subjectLabel"] = table#517 { ["type"] = "literal", ["value"] = "A MIMD implementation of a parallel Euler solver for unstructured grids", ["xml:lang"] = "en", }, }, table#518 { ["itemType"] = table#519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q975979", }, ["subjectLabel"] = table#521 { ["type"] = "literal", ["value"] = "A model for renal arterial branching based on graph theory", ["xml:lang"] = "en", }, }, table#522 { ["itemType"] = table#523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q976565", }, ["subjectLabel"] = table#525 { ["type"] = "literal", ["value"] = "Randić index and eigenvalues of graphs", ["xml:lang"] = "en", }, }, table#526 { ["itemType"] = table#527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q977665", }, ["subjectLabel"] = table#529 { ["type"] = "literal", ["value"] = "Finding short cycles in embedded graph in polynomial time", ["xml:lang"] = "en", }, }, table#530 { ["itemType"] = table#531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q982233", }, ["subjectLabel"] = table#533 { ["type"] = "literal", ["value"] = "On the maximum Zagreb indices of graphs with \$k\$ cut vertices", ["xml:lang"] = "en", }, }, table#534 { ["itemType"] = table#535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q987372", }, ["subjectLabel"] = table#537 { ["type"] = "literal", ["value"] = "Comparing universal covers in polynomial time", ["xml:lang"] = "en", }, }, table#538 { ["itemType"] = table#539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q995763", }, ["subjectLabel"] = table#541 { ["type"] = "literal", ["value"] = "An \$s\$-Hamiltonian line graph problem", ["xml:lang"] = "en", }, }, table#542 { ["itemType"] = table#543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q998526", }, ["subjectLabel"] = table#545 { ["type"] = "literal", ["value"] = "The Hamiltonian index of graphs", ["xml:lang"] = "en", }, }, table#546 { ["itemType"] = table#547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1002590", }, ["subjectLabel"] = table#549 { ["type"] = "literal", ["value"] = "On the maximal signless Laplacian spectral radius of graphs with given matching number", ["xml:lang"] = "en", }, }, table#550 { ["itemType"] = table#551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1004683", }, ["subjectLabel"] = table#553 { ["type"] = "literal", ["value"] = "Trees with \$m\$-matchings and the fourth and fifth minimal Hosoya index", ["xml:lang"] = "en", }, }, table#554 { ["itemType"] = table#555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1005735", }, ["subjectLabel"] = table#557 { ["type"] = "literal", ["value"] = "A new sufficient condition for Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#558 { ["itemType"] = table#559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1008540", }, ["subjectLabel"] = table#561 { ["type"] = "literal", ["value"] = "Bipartite toughness and \$k\$-factors in bipartite graphs", ["xml:lang"] = "en", }, }, table#562 { ["itemType"] = table#563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1011749", }, ["subjectLabel"] = table#565 { ["type"] = "literal", ["value"] = "On signed cycle domination in graphs", ["xml:lang"] = "en", }, }, table#566 { ["itemType"] = table#567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1011773", }, ["subjectLabel"] = table#569 { ["type"] = "literal", ["value"] = "Edge-connectivity and edge-disjoint spanning trees", ["xml:lang"] = "en", }, }, table#570 { ["itemType"] = table#571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1013303", }, ["subjectLabel"] = table#573 { ["type"] = "literal", ["value"] = "Minimum partition of an independence system into independent sets", ["xml:lang"] = "en", }, }, table#574 { ["itemType"] = table#575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1014473", }, ["subjectLabel"] = table#577 { ["type"] = "literal", ["value"] = "Some results on the Laplacian eigenvalues of unicyclic graphs", ["xml:lang"] = "en", }, }, table#578 { ["itemType"] = table#579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1014826", }, ["subjectLabel"] = table#581 { ["type"] = "literal", ["value"] = "Linear chromatic bounds for a subfamily of \$3K_{1}\$-free graphs", ["xml:lang"] = "en", }, }, table#582 { ["itemType"] = table#583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1014829", }, ["subjectLabel"] = table#585 { ["type"] = "literal", ["value"] = "On path factors of \$(3,4)\$-biregular bigraphs", ["xml:lang"] = "en", }, }, table#586 { ["itemType"] = table#587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1014832", }, ["subjectLabel"] = table#589 { ["type"] = "literal", ["value"] = "On the circumference of 2-connected \$\\mathcal{P}_{3}\$-dominated graphs", ["xml:lang"] = "en", }, }, table#590 { ["itemType"] = table#591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1015425", }, ["subjectLabel"] = table#593 { ["type"] = "literal", ["value"] = "On group connectivity of graphs", ["xml:lang"] = "en", }, }, table#594 { ["itemType"] = table#595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1015432", }, ["subjectLabel"] = table#597 { ["type"] = "literal", ["value"] = "The crossing number of \$C(8,2)\\square P_{n}\$", ["xml:lang"] = "en", }, }, table#598 { ["itemType"] = table#599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1015433", }, ["subjectLabel"] = table#601 { ["type"] = "literal", ["value"] = "On the determination problem for \$P_{4}\$-transformation of graphs", ["xml:lang"] = "en", }, }, table#602 { ["itemType"] = table#603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1015434", }, ["subjectLabel"] = table#605 { ["type"] = "literal", ["value"] = "Degree condition for subdivisions of unicyclic graphs", ["xml:lang"] = "en", }, }, table#606 { ["itemType"] = table#607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1015435", }, ["subjectLabel"] = table#609 { ["type"] = "literal", ["value"] = "Sufficient conditions for super-arc-strongly connected oriented graphs", ["xml:lang"] = "en", }, }, table#610 { ["itemType"] = table#611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1015441", }, ["subjectLabel"] = table#613 { ["type"] = "literal", ["value"] = "Factor-critical graphs with given number of maximum matchings", ["xml:lang"] = "en", }, }, table#614 { ["itemType"] = table#615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1016020", }, ["subjectLabel"] = table#617 { ["type"] = "literal", ["value"] = "On quartic half-arc-transitive metacirculants", ["xml:lang"] = "en", }, }, table#618 { ["itemType"] = table#619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1017932", }, ["subjectLabel"] = table#621 { ["type"] = "literal", ["value"] = "Pan-connectedness of graphs with large neighborhood unions", ["xml:lang"] = "en", }, }, table#622 { ["itemType"] = table#623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1024880", }, ["subjectLabel"] = table#625 { ["type"] = "literal", ["value"] = "Higmanian rank-5 association schemes on 40 points", ["xml:lang"] = "en", }, }, table#626 { ["itemType"] = table#627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1025485", }, ["subjectLabel"] = table#629 { ["type"] = "literal", ["value"] = "On the classification of quartic half-arc-transitive metacirculants", ["xml:lang"] = "en", }, }, table#630 { ["itemType"] = table#631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1026141", }, ["subjectLabel"] = table#633 { ["type"] = "literal", ["value"] = "Some results related to the tenacity and existence of \$k\$-trees", ["xml:lang"] = "en", }, }, table#634 { ["itemType"] = table#635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1028482", }, ["subjectLabel"] = table#637 { ["type"] = "literal", ["value"] = "Groups with the same non-commuting graph.", ["xml:lang"] = "en", }, }, table#638 { ["itemType"] = table#639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1032002", }, ["subjectLabel"] = table#641 { ["type"] = "literal", ["value"] = "Trees with second minimum general Randić index for \$\\alpha >0\$", ["xml:lang"] = "en", }, }, table#642 { ["itemType"] = table#643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1032004", }, ["subjectLabel"] = table#645 { ["type"] = "literal", ["value"] = "The heterochromatic cycles in edge-colored graphs", ["xml:lang"] = "en", }, }, table#646 { ["itemType"] = table#647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1032504", }, ["subjectLabel"] = table#649 { ["type"] = "literal", ["value"] = "Edge-decompositions of highly connected graphs into paths", ["xml:lang"] = "en", }, }, table#650 { ["itemType"] = table#651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1032794", }, ["subjectLabel"] = table#653 { ["type"] = "literal", ["value"] = "On \$K_{1,k}\$-factorization of bipartite multigraphs", ["xml:lang"] = "en", }, }, table#654 { ["itemType"] = table#655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1032813", }, ["subjectLabel"] = table#657 { ["type"] = "literal", ["value"] = "Degree series of the 3-harmonic graphs", ["xml:lang"] = "en", }, }, table#658 { ["itemType"] = table#659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1034303", }, ["subjectLabel"] = table#661 { ["type"] = "literal", ["value"] = "A variation of a conjecture due to Erdös and Sós", ["xml:lang"] = "en", }, }, table#662 { ["itemType"] = table#663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1034963", }, ["subjectLabel"] = table#665 { ["type"] = "literal", ["value"] = "On 2-factors with cycles containing specified vertices in a bipartite graph", ["xml:lang"] = "en", }, }, table#666 { ["itemType"] = table#667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1036905", }, ["subjectLabel"] = table#669 { ["type"] = "literal", ["value"] = "An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph", ["xml:lang"] = "en", }, }, table#670 { ["itemType"] = table#671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1040547", }, ["subjectLabel"] = table#673 { ["type"] = "literal", ["value"] = "A minimum degree condition of fractional \$(k,m)\$-deleted graphs", ["xml:lang"] = "en", }, }, table#674 { ["itemType"] = table#675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1040646", }, ["subjectLabel"] = table#677 { ["type"] = "literal", ["value"] = "Linear time algorithms for finding a dominating set of fixed size in degenerated graphs", ["xml:lang"] = "en", }, }, table#678 { ["itemType"] = table#679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1042914", }, ["subjectLabel"] = table#681 { ["type"] = "literal", ["value"] = "Up-embeddability via girth and the degree-sum of adjacent vertices", ["xml:lang"] = "en", }, }, table#682 { ["itemType"] = table#683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1043570", }, ["subjectLabel"] = table#685 { ["type"] = "literal", ["value"] = "On 2-walks in chordal planar graphs", ["xml:lang"] = "en", }, }, table#686 { ["itemType"] = table#687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1043644", }, ["subjectLabel"] = table#689 { ["type"] = "literal", ["value"] = "Sufficient conditions for bipartite graphs to be super-\$k\$-restricted edge connected", ["xml:lang"] = "en", }, }, table#690 { ["itemType"] = table#691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1043808", }, ["subjectLabel"] = table#693 { ["type"] = "literal", ["value"] = "Dirac's type sufficient conditions for hamiltonicity and pancyclicity", ["xml:lang"] = "en", }, }, table#694 { ["itemType"] = table#695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1043810", }, ["subjectLabel"] = table#697 { ["type"] = "literal", ["value"] = "Upper embeddability, girth and the degree-sum of nonadjacent vertices", ["xml:lang"] = "en", }, }, table#698 { ["itemType"] = table#699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1043812", }, ["subjectLabel"] = table#701 { ["type"] = "literal", ["value"] = "The signless Laplacian spectral radius of graphs with given number of pendant vertices", ["xml:lang"] = "en", }, }, table#702 { ["itemType"] = table#703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1043815", }, ["subjectLabel"] = table#705 { ["type"] = "literal", ["value"] = "On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles", ["xml:lang"] = "en", }, }, table#706 { ["itemType"] = table#707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1044020", }, ["subjectLabel"] = table#709 { ["type"] = "literal", ["value"] = "Ordered interval routing schemes", ["xml:lang"] = "en", }, }, table#710 { ["itemType"] = table#711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1044271", }, ["subjectLabel"] = table#713 { ["type"] = "literal", ["value"] = "Fundamental cycles and graph embeddings", ["xml:lang"] = "en", }, }, table#714 { ["itemType"] = table#715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1044280", }, ["subjectLabel"] = table#717 { ["type"] = "literal", ["value"] = "Upper embeddability, edge independence number and girth", ["xml:lang"] = "en", }, }, table#718 { ["itemType"] = table#719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1044320", }, ["subjectLabel"] = table#721 { ["type"] = "literal", ["value"] = "Graphs isomorphic to their maximum matching graphs", ["xml:lang"] = "en", }, }, table#722 { ["itemType"] = table#723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1045065", }, ["subjectLabel"] = table#725 { ["type"] = "literal", ["value"] = "On the complexity of \$H\$-colouring planar graphs", ["xml:lang"] = "en", }, }, table#726 { ["itemType"] = table#727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1052329", }, ["subjectLabel"] = table#729 { ["type"] = "literal", ["value"] = "Ordered colourings of graphs", ["xml:lang"] = "en", }, }, table#730 { ["itemType"] = table#731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1052335", }, ["subjectLabel"] = table#733 { ["type"] = "literal", ["value"] = "Non-Hamiltonian 3-connected cubic bipartite graphs", ["xml:lang"] = "en", }, }, table#734 { ["itemType"] = table#735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1055430", }, ["subjectLabel"] = table#737 { ["type"] = "literal", ["value"] = "Long cycles generate the cycle space of a graph", ["xml:lang"] = "en", }, }, table#738 { ["itemType"] = table#739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1059086", }, ["subjectLabel"] = table#741 { ["type"] = "literal", ["value"] = "Long cycles in bipartite graphs", ["xml:lang"] = "en", }, }, table#742 { ["itemType"] = table#743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1059647", }, ["subjectLabel"] = table#745 { ["type"] = "literal", ["value"] = "No graph has a maximal 3-ring of bonds", ["xml:lang"] = "en", }, }, table#746 { ["itemType"] = table#747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1062078", }, ["subjectLabel"] = table#749 { ["type"] = "literal", ["value"] = "Similarity reconstruction of trees", ["xml:lang"] = "en", }, }, table#750 { ["itemType"] = table#751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1063044", }, ["subjectLabel"] = table#753 { ["type"] = "literal", ["value"] = "On factors with all degrees odd", ["xml:lang"] = "en", }, }, table#754 { ["itemType"] = table#755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1065022", }, ["subjectLabel"] = table#757 { ["type"] = "literal", ["value"] = "A generalization of Dirac's theorem", ["xml:lang"] = "en", }, }, table#758 { ["itemType"] = table#759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1065826", }, ["subjectLabel"] = table#761 { ["type"] = "literal", ["value"] = "Hamilton cycles in Euler tour graphs", ["xml:lang"] = "en", }, }, table#762 { ["itemType"] = table#763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1068850", }, ["subjectLabel"] = table#765 { ["type"] = "literal", ["value"] = "On the degrees of vertices in locally finite graphs which possess a certain edge deletion property", ["xml:lang"] = "en", }, }, table#766 { ["itemType"] = table#767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1069953", }, ["subjectLabel"] = table#769 { ["type"] = "literal", ["value"] = "On weakly symmetric graphs of order twice a prime", ["xml:lang"] = "en", }, }, table#770 { ["itemType"] = table#771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1069955", }, ["subjectLabel"] = table#773 { ["type"] = "literal", ["value"] = "Cycle covering in bridgeless graphs", ["xml:lang"] = "en", }, }, table#774 { ["itemType"] = table#775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1070236", }, ["subjectLabel"] = table#777 { ["type"] = "literal", ["value"] = "Connectivity in bicircular matroids", ["xml:lang"] = "en", }, }, table#778 { ["itemType"] = table#779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1070241", }, ["subjectLabel"] = table#781 { ["type"] = "literal", ["value"] = "Score vectors of Kotzig tournaments", ["xml:lang"] = "en", }, }, table#782 { ["itemType"] = table#783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1070245", }, ["subjectLabel"] = table#785 { ["type"] = "literal", ["value"] = "On shortest cocycle covers of graphs", ["xml:lang"] = "en", }, }, table#786 { ["itemType"] = table#787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071035", }, ["subjectLabel"] = table#789 { ["type"] = "literal", ["value"] = "On the edge reconstruction of locally finite disconnected graphs with a finite number of components", ["xml:lang"] = "en", }, }, table#790 { ["itemType"] = table#791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071789", }, ["subjectLabel"] = table#793 { ["type"] = "literal", ["value"] = "Minimum degree of a graph and the existence of k-factors", ["xml:lang"] = "en", }, }, table#794 { ["itemType"] = table#795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1072568", }, ["subjectLabel"] = table#797 { ["type"] = "literal", ["value"] = "Proof of the strong 2-cover conjecture for planar graphs", ["xml:lang"] = "en", }, }, table#798 { ["itemType"] = table#799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1074598", }, ["subjectLabel"] = table#801 { ["type"] = "literal", ["value"] = "Longest cycles in 3-connected cubic graphs", ["xml:lang"] = "en", }, }, table#802 { ["itemType"] = table#803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q264588", }, ["subjectLabel"] = table#805 { ["type"] = "literal", ["value"] = "\$g\$-good-neighbor conditional diagnosability measures for 3-ary \$n\$-cube networks", ["xml:lang"] = "en", }, }, table#806 { ["itemType"] = table#807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q266847", }, ["subjectLabel"] = table#809 { ["type"] = "literal", ["value"] = "Weak saturation number for multiple copies of the complete graph with a star removed", ["xml:lang"] = "en", }, }, table#810 { ["itemType"] = table#811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q268085", }, ["subjectLabel"] = table#813 { ["type"] = "literal", ["value"] = "Classification of finite commutative rings with planar, toroidal, and projective line graphs associated with Jacobson graphs", ["xml:lang"] = "en", }, }, table#814 { ["itemType"] = table#815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q269530", }, ["subjectLabel"] = table#817 { ["type"] = "literal", ["value"] = "On energy of line graphs", ["xml:lang"] = "en", }, }, table#818 { ["itemType"] = table#819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q274691", }, ["subjectLabel"] = table#821 { ["type"] = "literal", ["value"] = "Heavy subgraph conditions for longest cycles to be heavy in graphs", ["xml:lang"] = "en", }, }, table#822 { ["itemType"] = table#823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q277096", }, ["subjectLabel"] = table#825 { ["type"] = "literal", ["value"] = "The cycle's structure of embedded graphs in surfaces", ["xml:lang"] = "en", }, }, table#826 { ["itemType"] = table#827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q278371", }, ["subjectLabel"] = table#829 { ["type"] = "literal", ["value"] = "Hamiltonian cycle embedding for fault tolerance in balanced hypercubes", ["xml:lang"] = "en", }, }, table#830 { ["itemType"] = table#831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q281275", }, ["subjectLabel"] = table#833 { ["type"] = "literal", ["value"] = "jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology", ["xml:lang"] = "en", }, }, table#834 { ["itemType"] = table#835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q281769", }, ["subjectLabel"] = table#837 { ["type"] = "literal", ["value"] = "Acyclic coloring of graphs with some girth restriction", ["xml:lang"] = "en", }, }, table#838 { ["itemType"] = table#839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q281773", }, ["subjectLabel"] = table#841 { ["type"] = "literal", ["value"] = "A simple greedy approximation algorithm for the minimum connected \$k\$-center problem", ["xml:lang"] = "en", }, }, table#842 { ["itemType"] = table#843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q283940", }, ["subjectLabel"] = table#845 { ["type"] = "literal", ["value"] = "Inverse 1-median problem on block graphs with variable vertex weights", ["xml:lang"] = "en", }, }, table#846 { ["itemType"] = table#847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q284352", }, ["subjectLabel"] = table#849 { ["type"] = "literal", ["value"] = "The \$g\$-good-neighbor conditional diagnosability of \$n\$-dimensional hypercubes under the MM* model", ["xml:lang"] = "en", }, }, table#850 { ["itemType"] = table#851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q284357", }, ["subjectLabel"] = table#853 { ["type"] = "literal", ["value"] = "Hamiltonian decomposition of generalized recursive circulant graphs", ["xml:lang"] = "en", }, }, table#854 { ["itemType"] = table#855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q284713", }, ["subjectLabel"] = table#857 { ["type"] = "literal", ["value"] = "An extremal problem on bigraphic pairs with an \$A\$-connected realization", ["xml:lang"] = "en", }, }, table#858 { ["itemType"] = table#859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q284900", }, ["subjectLabel"] = table#861 { ["type"] = "literal", ["value"] = "Generalized probabilistic \$G\$-contractions", ["xml:lang"] = "en", }, }, table#862 { ["itemType"] = table#863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q287873", }, ["subjectLabel"] = table#865 { ["type"] = "literal", ["value"] = "An implicit degree condition for relative length of long paths and cycles in graphs", ["xml:lang"] = "en", }, }, table#866 { ["itemType"] = table#867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q287913", }, ["subjectLabel"] = table#869 { ["type"] = "literal", ["value"] = "Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz", ["xml:lang"] = "en", }, }, table#870 { ["itemType"] = table#871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q289719", }, ["subjectLabel"] = table#873 { ["type"] = "literal", ["value"] = "On the spectral moment of graphs with given clique number", ["xml:lang"] = "en", }, }, table#874 { ["itemType"] = table#875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q289977", }, ["subjectLabel"] = table#877 { ["type"] = "literal", ["value"] = "0-sum and 1-sum flows in regular graphs", ["xml:lang"] = "en", }, }, table#878 { ["itemType"] = table#879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q290801", }, ["subjectLabel"] = table#881 { ["type"] = "literal", ["value"] = "Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.", ["xml:lang"] = "en", }, }, table#882 { ["itemType"] = table#883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q290803", }, ["subjectLabel"] = table#885 { ["type"] = "literal", ["value"] = "Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.", ["xml:lang"] = "en", }, }, table#886 { ["itemType"] = table#887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q293647", }, ["subjectLabel"] = table#889 { ["type"] = "literal", ["value"] = "Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions", ["xml:lang"] = "en", }, }, table#890 { ["itemType"] = table#891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q294886", }, ["subjectLabel"] = table#893 { ["type"] = "literal", ["value"] = "Updating \$\\leqslant, <\$-chains", ["xml:lang"] = "en", }, }, table#894 { ["itemType"] = table#895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q295256", }, ["subjectLabel"] = table#897 { ["type"] = "literal", ["value"] = "A note on edge-disjoint Hamilton cycles in line graphs", ["xml:lang"] = "en", }, }, table#898 { ["itemType"] = table#899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q295940", }, ["subjectLabel"] = table#901 { ["type"] = "literal", ["value"] = "Embedding generalized Petersen graph in books", ["xml:lang"] = "en", }, }, table#902 { ["itemType"] = table#903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q298865", }, ["subjectLabel"] = table#905 { ["type"] = "literal", ["value"] = "Topological indices of the line graph of subdivision graphs and their Schur-bounds", ["xml:lang"] = "en", }, }, table#906 { ["itemType"] = table#907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q298990", }, ["subjectLabel"] = table#909 { ["type"] = "literal", ["value"] = "Hamiltonian cycles in spanning subgraphs of line graphs", ["xml:lang"] = "en", }, }, table#910 { ["itemType"] = table#911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q306111", }, ["subjectLabel"] = table#913 { ["type"] = "literal", ["value"] = "A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles", ["xml:lang"] = "en", }, }, table#914 { ["itemType"] = table#915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q306114", }, ["subjectLabel"] = table#917 { ["type"] = "literal", ["value"] = "An improved bound on 2-distance coloring plane graphs with girth 5", ["xml:lang"] = "en", }, }, table#918 { ["itemType"] = table#919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q308339", }, ["subjectLabel"] = table#921 { ["type"] = "literal", ["value"] = "Minimum implicit degree condition restricted to claws for Hamiltonian cycles", ["xml:lang"] = "en", }, }, table#922 { ["itemType"] = table#923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q309924", }, ["subjectLabel"] = table#925 { ["type"] = "literal", ["value"] = "A note on the complexity of the causal ordering problem", ["xml:lang"] = "en", }, }, table#926 { ["itemType"] = table#927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q311550", }, ["subjectLabel"] = table#929 { ["type"] = "literal", ["value"] = "Cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular \$p\$-group", ["xml:lang"] = "en", }, }, table#930 { ["itemType"] = table#931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q317426", }, ["subjectLabel"] = table#933 { ["type"] = "literal", ["value"] = "On the hyperbolicity of bipartite graphs and intersection graphs", ["xml:lang"] = "en", }, }, table#934 { ["itemType"] = table#935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q317825", }, ["subjectLabel"] = table#937 { ["type"] = "literal", ["value"] = "Hamilton cycles in almost distance-hereditary graphs", ["xml:lang"] = "en", }, }, table#938 { ["itemType"] = table#939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q318913", }, ["subjectLabel"] = table#941 { ["type"] = "literal", ["value"] = "Clique-heavy subgraphs and pancyclicity of 2-connected graphs", ["xml:lang"] = "en", }, }, table#942 { ["itemType"] = table#943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q326469", }, ["subjectLabel"] = table#945 { ["type"] = "literal", ["value"] = "Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs", ["xml:lang"] = "en", }, }, table#946 { ["itemType"] = table#947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q326491", }, ["subjectLabel"] = table#949 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total choosability of planar graphs", ["xml:lang"] = "en", }, }, table#950 { ["itemType"] = table#951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q326498", }, ["subjectLabel"] = table#953 { ["type"] = "literal", ["value"] = "Maximum size of digraphs with some parameters", ["xml:lang"] = "en", }, }, table#954 { ["itemType"] = table#955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q326504", }, ["subjectLabel"] = table#957 { ["type"] = "literal", ["value"] = "A diagnosis algorithm by using graph-coloring under the PMC model", ["xml:lang"] = "en", }, }, table#958 { ["itemType"] = table#959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q326982", }, ["subjectLabel"] = table#961 { ["type"] = "literal", ["value"] = "A note on the minimum total coloring of planar graphs", ["xml:lang"] = "en", }, }, table#962 { ["itemType"] = table#963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q327292", }, ["subjectLabel"] = table#965 { ["type"] = "literal", ["value"] = "Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs", ["xml:lang"] = "en", }, }, table#966 { ["itemType"] = table#967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q335318", }, ["subjectLabel"] = table#969 { ["type"] = "literal", ["value"] = "Some class 1 graphs on \$g_c\$-colorings", ["xml:lang"] = "en", }, }, table#970 { ["itemType"] = table#971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q335575", }, ["subjectLabel"] = table#973 { ["type"] = "literal", ["value"] = "Degree sum of a pair of independent edges and \$Z_{3}\$-connectivity", ["xml:lang"] = "en", }, }, table#974 { ["itemType"] = table#975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q339456", }, ["subjectLabel"] = table#977 { ["type"] = "literal", ["value"] = "Perfect set of Euler tours of \$K_{p,p,p}\$", ["xml:lang"] = "en", }, }, table#978 { ["itemType"] = table#979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q339462", }, ["subjectLabel"] = table#981 { ["type"] = "literal", ["value"] = "On the edge-hyper-Hamiltonian laceability of balanced hypercubes", ["xml:lang"] = "en", }, }, table#982 { ["itemType"] = table#983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q342402", }, ["subjectLabel"] = table#985 { ["type"] = "literal", ["value"] = "Maximising expectation of the number of transplants in kidney exchange programmes", ["xml:lang"] = "en", }, }, table#986 { ["itemType"] = table#987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q343715", }, ["subjectLabel"] = table#989 { ["type"] = "literal", ["value"] = "Word-representability of face subdivisions of triangular grid graphs", ["xml:lang"] = "en", }, }, table#990 { ["itemType"] = table#991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q343757", }, ["subjectLabel"] = table#993 { ["type"] = "literal", ["value"] = "Color degree sum conditions for rainbow triangles in edge-colored graphs", ["xml:lang"] = "en", }, }, table#994 { ["itemType"] = table#995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q345079", }, ["subjectLabel"] = table#997 { ["type"] = "literal", ["value"] = "Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs", ["xml:lang"] = "en", }, }, table#998 { ["itemType"] = table#999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q345111", }, ["subjectLabel"] = table#1001 { ["type"] = "literal", ["value"] = "The number of colorings of planar graphs with no separating triangles", ["xml:lang"] = "en", }, }, table#1002 { ["itemType"] = table#1003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q353624", }, ["subjectLabel"] = table#1005 { ["type"] = "literal", ["value"] = "On edge colorings of 1-toroidal graphs", ["xml:lang"] = "en", }, }, table#1006 { ["itemType"] = table#1007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q361562", }, ["subjectLabel"] = table#1009 { ["type"] = "literal", ["value"] = "Unit graphs of rings of polynomials and power series", ["xml:lang"] = "en", }, }, table#1010 { ["itemType"] = table#1011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q364520", }, ["subjectLabel"] = table#1013 { ["type"] = "literal", ["value"] = "Bounds for incidence energy of some graphs", ["xml:lang"] = "en", }, }, table#1014 { ["itemType"] = table#1015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q364548", }, ["subjectLabel"] = table#1017 { ["type"] = "literal", ["value"] = "Graph operations and neighbor rupture degree", ["xml:lang"] = "en", }, }, table#1018 { ["itemType"] = table#1019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q367074", }, ["subjectLabel"] = table#1021 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing index", ["xml:lang"] = "en", }, }, table#1022 { ["itemType"] = table#1023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q367087", }, ["subjectLabel"] = table#1025 { ["type"] = "literal", ["value"] = "A note on Turán numbers for even wheels", ["xml:lang"] = "en", }, }, table#1026 { ["itemType"] = table#1027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q367090", }, ["subjectLabel"] = table#1029 { ["type"] = "literal", ["value"] = "An implicit degree condition for pancyclicity of graphs", ["xml:lang"] = "en", }, }, table#1030 { ["itemType"] = table#1031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q367097", }, ["subjectLabel"] = table#1033 { ["type"] = "literal", ["value"] = "Advanced lower bounds for the circumference", ["xml:lang"] = "en", }, }, table#1034 { ["itemType"] = table#1035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q367447", }, ["subjectLabel"] = table#1037 { ["type"] = "literal", ["value"] = "Transforming monitoring structures with resilient encoders -- application to repeated games", ["xml:lang"] = "en", }, }, table#1038 { ["itemType"] = table#1039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q377913", }, ["subjectLabel"] = table#1041 { ["type"] = "literal", ["value"] = "Ordering polygonal chains with respect to Hosoya index", ["xml:lang"] = "en", }, }, table#1042 { ["itemType"] = table#1043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q381084", }, ["subjectLabel"] = table#1045 { ["type"] = "literal", ["value"] = "Group edge choosability of planar graphs without adjacent short cycles", ["xml:lang"] = "en", }, }, table#1046 { ["itemType"] = table#1047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q381093", }, ["subjectLabel"] = table#1049 { ["type"] = "literal", ["value"] = "Edge coloring by total labelings of outerplanar graphs", ["xml:lang"] = "en", }, }, table#1050 { ["itemType"] = table#1051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q382146", }, ["subjectLabel"] = table#1053 { ["type"] = "literal", ["value"] = "Properties of Hamilton cycles of circuit graphs of matroids", ["xml:lang"] = "en", }, }, table#1054 { ["itemType"] = table#1055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q383349", }, ["subjectLabel"] = table#1057 { ["type"] = "literal", ["value"] = "On extremal \$k\$-supereulerian graphs", ["xml:lang"] = "en", }, }, table#1058 { ["itemType"] = table#1059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q383626", }, ["subjectLabel"] = table#1061 { ["type"] = "literal", ["value"] = "An implicit degree Ore-condition for pancyclicity of graphs", ["xml:lang"] = "en", }, }, table#1062 { ["itemType"] = table#1063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q383688", }, ["subjectLabel"] = table#1065 { ["type"] = "literal", ["value"] = "Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs", ["xml:lang"] = "en", }, }, table#1066 { ["itemType"] = table#1067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q383748", }, ["subjectLabel"] = table#1069 { ["type"] = "literal", ["value"] = "Rainbow \$C_3\$'s and \$C_4\$'s in edge-colored graphs", ["xml:lang"] = "en", }, }, table#1070 { ["itemType"] = table#1071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q383761", }, ["subjectLabel"] = table#1073 { ["type"] = "literal", ["value"] = "Cubic factorizations", ["xml:lang"] = "en", }, }, table#1074 { ["itemType"] = table#1075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q383779", }, ["subjectLabel"] = table#1077 { ["type"] = "literal", ["value"] = "Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey", ["xml:lang"] = "en", }, }, table#1078 { ["itemType"] = table#1079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q384196", }, ["subjectLabel"] = table#1081 { ["type"] = "literal", ["value"] = "On the mixed minus domination in graphs", ["xml:lang"] = "en", }, }, table#1082 { ["itemType"] = table#1083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q385157", }, ["subjectLabel"] = table#1085 { ["type"] = "literal", ["value"] = "Full friendly index set. I", ["xml:lang"] = "en", }, }, table#1086 { ["itemType"] = table#1087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q385383", }, ["subjectLabel"] = table#1089 { ["type"] = "literal", ["value"] = "Tree-designs with balanced-type conditions", ["xml:lang"] = "en", }, }, table#1090 { ["itemType"] = table#1091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q385953", }, ["subjectLabel"] = table#1093 { ["type"] = "literal", ["value"] = "Vertex Nim played on graphs", ["xml:lang"] = "en", }, }, table#1094 { ["itemType"] = table#1095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q386373", }, ["subjectLabel"] = table#1097 { ["type"] = "literal", ["value"] = "Tricyclic graphs with exactly two main eigenvalues", ["xml:lang"] = "en", }, }, table#1098 { ["itemType"] = table#1099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q388089", }, ["subjectLabel"] = table#1101 { ["type"] = "literal", ["value"] = "Greedy routing via embedding graphs onto semi-metric spaces", ["xml:lang"] = "en", }, }, table#1102 { ["itemType"] = table#1103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q389204", }, ["subjectLabel"] = table#1105 { ["type"] = "literal", ["value"] = "Equitable and list equitable colorings of planar graphs without 4-cycles", ["xml:lang"] = "en", }, }, table#1106 { ["itemType"] = table#1107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q389473", }, ["subjectLabel"] = table#1109 { ["type"] = "literal", ["value"] = "Degree sum of 3 independent vertices and \$Z_3\$-connectivity", ["xml:lang"] = "en", }, }, table#1110 { ["itemType"] = table#1111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q389989", }, ["subjectLabel"] = table#1113 { ["type"] = "literal", ["value"] = "\$Z_3\$-connectivity in abelian Cayley graphs", ["xml:lang"] = "en", }, }, table#1114 { ["itemType"] = table#1115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q391230", }, ["subjectLabel"] = table#1117 { ["type"] = "literal", ["value"] = "Optimally restricted edge connected elementary Harary graphs", ["xml:lang"] = "en", }, }, table#1118 { ["itemType"] = table#1119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q393179", }, ["subjectLabel"] = table#1121 { ["type"] = "literal", ["value"] = "Injective coloring of plane graphs with girth 5", ["xml:lang"] = "en", }, }, table#1122 { ["itemType"] = table#1123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q393451", }, ["subjectLabel"] = table#1125 { ["type"] = "literal", ["value"] = "List total coloring of pseudo-outerplanar graphs", ["xml:lang"] = "en", }, }, table#1126 { ["itemType"] = table#1127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q393898", }, ["subjectLabel"] = table#1129 { ["type"] = "literal", ["value"] = "Total coloring of planar graphs with maximum degree 8", ["xml:lang"] = "en", }, }, table#1130 { ["itemType"] = table#1131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q393930", }, ["subjectLabel"] = table#1133 { ["type"] = "literal", ["value"] = "The maximum Perron roots of digraphs with some given parameters", ["xml:lang"] = "en", }, }, table#1134 { ["itemType"] = table#1135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q394471", }, ["subjectLabel"] = table#1137 { ["type"] = "literal", ["value"] = "Some inverse optimization problems on network", ["xml:lang"] = "en", }, }, table#1138 { ["itemType"] = table#1139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q394540", }, ["subjectLabel"] = table#1141 { ["type"] = "literal", ["value"] = "Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges", ["xml:lang"] = "en", }, }, table#1142 { ["itemType"] = table#1143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q396740", }, ["subjectLabel"] = table#1145 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing index of planar graphs", ["xml:lang"] = "en", }, }, table#1146 { ["itemType"] = table#1147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q397156", }, ["subjectLabel"] = table#1149 { ["type"] = "literal", ["value"] = "Decomposition of complete bipartite graphs into paths and cycles", ["xml:lang"] = "en", }, }, table#1150 { ["itemType"] = table#1151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q397167", }, ["subjectLabel"] = table#1153 { ["type"] = "literal", ["value"] = "Rainbow numbers for matchings in plane triangulations", ["xml:lang"] = "en", }, }, table#1154 { ["itemType"] = table#1155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q400414", }, ["subjectLabel"] = table#1157 { ["type"] = "literal", ["value"] = "Realizing degree sequences as \$Z_3\$-connected graphs", ["xml:lang"] = "en", }, }, table#1158 { ["itemType"] = table#1159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q400495", }, ["subjectLabel"] = table#1161 { ["type"] = "literal", ["value"] = "On linear coloring of planar graphs with small girth", ["xml:lang"] = "en", }, }, table#1162 { ["itemType"] = table#1163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q402356", }, ["subjectLabel"] = table#1165 { ["type"] = "literal", ["value"] = "Hamilton cycles in implicit claw-heavy graphs", ["xml:lang"] = "en", }, }, table#1166 { ["itemType"] = table#1167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q402468", }, ["subjectLabel"] = table#1169 { ["type"] = "literal", ["value"] = "How to personalize the vertices of a graph?", ["xml:lang"] = "en", }, }, table#1170 { ["itemType"] = table#1171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q402597", }, ["subjectLabel"] = table#1173 { ["type"] = "literal", ["value"] = "Graph factors modulo \$k\$", ["xml:lang"] = "en", }, }, table#1174 { ["itemType"] = table#1175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q403490", }, ["subjectLabel"] = table#1177 { ["type"] = "literal", ["value"] = "An iterative rounding 2-approximation algorithm for the \$k\$-partial vertex cover problem", ["xml:lang"] = "en", }, }, table#1178 { ["itemType"] = table#1179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q405156", }, ["subjectLabel"] = table#1181 { ["type"] = "literal", ["value"] = "Total colorings of \$F_5\$-free planar graphs with maximum degree 8", ["xml:lang"] = "en", }, }, table#1182 { ["itemType"] = table#1183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q405265", }, ["subjectLabel"] = table#1185 { ["type"] = "literal", ["value"] = "Counting 2-connected 4-regular maps on the projective plane", ["xml:lang"] = "en", }, }, table#1186 { ["itemType"] = table#1187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q405685", }, ["subjectLabel"] = table#1189 { ["type"] = "literal", ["value"] = "Minimum number of disjoint linear forests covering a planar graph", ["xml:lang"] = "en", }, }, table#1190 { ["itemType"] = table#1191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q260055", }, ["subjectLabel"] = table#1193 { ["type"] = "literal", ["value"] = "Some extremal graphs with respect to inverse degree", ["xml:lang"] = "en", }, }, table#1194 { ["itemType"] = table#1195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q260066", }, ["subjectLabel"] = table#1197 { ["type"] = "literal", ["value"] = "On degree resistance distance of cacti", ["xml:lang"] = "en", }, }, table#1198 { ["itemType"] = table#1199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q262985", }, ["subjectLabel"] = table#1201 { ["type"] = "literal", ["value"] = "Realizability of fault-tolerant graphs", ["xml:lang"] = "en", }, }, table#1202 { ["itemType"] = table#1203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q605003", }, ["subjectLabel"] = table#1205 { ["type"] = "literal", ["value"] = "Degree bounded spanning trees", ["xml:lang"] = "en", }, }, table#1206 { ["itemType"] = table#1207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q607682", }, ["subjectLabel"] = table#1209 { ["type"] = "literal", ["value"] = "Vertex-distinguishing edge colorings of graphs with degree sum conditions", ["xml:lang"] = "en", }, }, table#1210 { ["itemType"] = table#1211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q607686", }, ["subjectLabel"] = table#1213 { ["type"] = "literal", ["value"] = "Binding numbers and connected factors", ["xml:lang"] = "en", }, }, table#1214 { ["itemType"] = table#1215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q608279", }, ["subjectLabel"] = table#1217 { ["type"] = "literal", ["value"] = "Sharp bounds for the Zagreb indices of bicyclic graphs with \$k\$-pendant vertices", ["xml:lang"] = "en", }, }, table#1218 { ["itemType"] = table#1219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q615259", }, ["subjectLabel"] = table#1221 { ["type"] = "literal", ["value"] = "A note on Laplacian eigenmaps", ["xml:lang"] = "en", }, }, table#1222 { ["itemType"] = table#1223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q620956", }, ["subjectLabel"] = table#1225 { ["type"] = "literal", ["value"] = "An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs", ["xml:lang"] = "en", }, }, table#1226 { ["itemType"] = table#1227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q627564", }, ["subjectLabel"] = table#1229 { ["type"] = "literal", ["value"] = "The existence of even regular factors of regular graphs on the number of cut edges", ["xml:lang"] = "en", }, }, table#1230 { ["itemType"] = table#1231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q628322", }, ["subjectLabel"] = table#1233 { ["type"] = "literal", ["value"] = "Tenacity of a graph with maximum connectivity", ["xml:lang"] = "en", }, }, table#1234 { ["itemType"] = table#1235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q632996", }, ["subjectLabel"] = table#1237 { ["type"] = "literal", ["value"] = "\$k\$-forested coloring of planar graphs with large girth", ["xml:lang"] = "en", }, }, table#1238 { ["itemType"] = table#1239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q638528", }, ["subjectLabel"] = table#1241 { ["type"] = "literal", ["value"] = "Hardness of subgraph and supergraph problems in \$c\$-tournaments", ["xml:lang"] = "en", }, }, table#1242 { ["itemType"] = table#1243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q643606", }, ["subjectLabel"] = table#1245 { ["type"] = "literal", ["value"] = "Binding numbers and \$[a,b]\$-factors excluding a given \$k\$-factor", ["xml:lang"] = "en", }, }, table#1246 { ["itemType"] = table#1247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q643721", }, ["subjectLabel"] = table#1249 { ["type"] = "literal", ["value"] = "Zeros of the Jones polynomial for multiple crossing-twisted links", ["xml:lang"] = "en", }, }, table#1250 { ["itemType"] = table#1251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q645165", }, ["subjectLabel"] = table#1253 { ["type"] = "literal", ["value"] = "New Nordhaus-Gaddum-type results for the Kirchhoff index", ["xml:lang"] = "en", }, }, table#1254 { ["itemType"] = table#1255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q651281", }, ["subjectLabel"] = table#1257 { ["type"] = "literal", ["value"] = "On \$(p,1)\$-total labelling of 1-planar graphs", ["xml:lang"] = "en", }, }, table#1258 { ["itemType"] = table#1259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q652714", }, ["subjectLabel"] = table#1261 { ["type"] = "literal", ["value"] = "The architecture and the Jones polynomial of polyhedral links", ["xml:lang"] = "en", }, }, table#1262 { ["itemType"] = table#1263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659684", }, ["subjectLabel"] = table#1265 { ["type"] = "literal", ["value"] = "The \$k\$-restricted edge connectivity of balanced bipartite graphs", ["xml:lang"] = "en", }, }, table#1266 { ["itemType"] = table#1267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659687", }, ["subjectLabel"] = table#1269 { ["type"] = "literal", ["value"] = "On 2-connected spanning subgraphs with bounded degree in \$K _{1,r }\$-free graphs", ["xml:lang"] = "en", }, }, table#1270 { ["itemType"] = table#1271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659742", }, ["subjectLabel"] = table#1273 { ["type"] = "literal", ["value"] = "Sums of powers of the degrees of graphs with \$k\$ cut edges", ["xml:lang"] = "en", }, }, table#1274 { ["itemType"] = table#1275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659743", }, ["subjectLabel"] = table#1277 { ["type"] = "literal", ["value"] = "On the perfect matchings of near regular graphs", ["xml:lang"] = "en", }, }, table#1278 { ["itemType"] = table#1279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659782", }, ["subjectLabel"] = table#1281 { ["type"] = "literal", ["value"] = "Mutually independent Hamiltonian connectivity of \$(n,k)\$-star graphs", ["xml:lang"] = "en", }, }, table#1282 { ["itemType"] = table#1283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659806", }, ["subjectLabel"] = table#1285 { ["type"] = "literal", ["value"] = "Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs", ["xml:lang"] = "en", }, }, table#1286 { ["itemType"] = table#1287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q659811", }, ["subjectLabel"] = table#1289 { ["type"] = "literal", ["value"] = "Maximum IPP codes of length 3", ["xml:lang"] = "en", }, }, table#1290 { ["itemType"] = table#1291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668025", }, ["subjectLabel"] = table#1293 { ["type"] = "literal", ["value"] = "Measures of edge-uncolorability of cubic graphs", ["xml:lang"] = "en", }, }, table#1294 { ["itemType"] = table#1295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668036", }, ["subjectLabel"] = table#1297 { ["type"] = "literal", ["value"] = "Signed cycle double covers", ["xml:lang"] = "en", }, }, table#1298 { ["itemType"] = table#1299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668121", }, ["subjectLabel"] = table#1301 { ["type"] = "literal", ["value"] = "On the tree with diameter 4 and maximal energy", ["xml:lang"] = "en", }, }, table#1302 { ["itemType"] = table#1303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668205", }, ["subjectLabel"] = table#1305 { ["type"] = "literal", ["value"] = "The unicyclic graphs with maximum degree resistance distance", ["xml:lang"] = "en", }, }, table#1306 { ["itemType"] = table#1307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668544", }, ["subjectLabel"] = table#1309 { ["type"] = "literal", ["value"] = "On energy and Laplacian energy of bipartite graphs", ["xml:lang"] = "en", }, }, table#1310 { ["itemType"] = table#1311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668864", }, ["subjectLabel"] = table#1313 { ["type"] = "literal", ["value"] = "Comparison between the zeroth-order Randić index and the sum-connectivity index", ["xml:lang"] = "en", }, }, table#1314 { ["itemType"] = table#1315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q668936", }, ["subjectLabel"] = table#1317 { ["type"] = "literal", ["value"] = "On the Graovac-Ghorbani index of graphs", ["xml:lang"] = "en", }, }, table#1318 { ["itemType"] = table#1319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q670230", }, ["subjectLabel"] = table#1321 { ["type"] = "literal", ["value"] = "Bounds on the spectral radius of a nonnegative matrix and its applications", ["xml:lang"] = "en", }, }, table#1322 { ["itemType"] = table#1323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q670686", }, ["subjectLabel"] = table#1325 { ["type"] = "literal", ["value"] = "On Laplacian energy in terms of graph invariants", ["xml:lang"] = "en", }, }, table#1326 { ["itemType"] = table#1327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q670772", }, ["subjectLabel"] = table#1329 { ["type"] = "literal", ["value"] = "Relations between distance-based and degree-based topological indices", ["xml:lang"] = "en", }, }, table#1330 { ["itemType"] = table#1331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q670829", }, ["subjectLabel"] = table#1333 { ["type"] = "literal", ["value"] = "Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index", ["xml:lang"] = "en", }, }, table#1334 { ["itemType"] = table#1335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q671141", }, ["subjectLabel"] = table#1337 { ["type"] = "literal", ["value"] = "On the Wiener polarity index of graphs", ["xml:lang"] = "en", }, }, table#1338 { ["itemType"] = table#1339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q671437", }, ["subjectLabel"] = table#1341 { ["type"] = "literal", ["value"] = "The complexity of subgraph isomorphism for classes of partial k-trees", ["xml:lang"] = "en", }, }, table#1342 { ["itemType"] = table#1343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q673073", }, ["subjectLabel"] = table#1345 { ["type"] = "literal", ["value"] = "Modular Nim", ["xml:lang"] = "en", }, }, table#1346 { ["itemType"] = table#1347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q675316", }, ["subjectLabel"] = table#1349 { ["type"] = "literal", ["value"] = "Three-dimensional graph drawing", ["xml:lang"] = "en", }, }, table#1350 { ["itemType"] = table#1351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q675883", }, ["subjectLabel"] = table#1353 { ["type"] = "literal", ["value"] = "\$d\$-cube decompositions of \$K_n\\setminus K_m\$", ["xml:lang"] = "en", }, }, table#1354 { ["itemType"] = table#1355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q677169", }, ["subjectLabel"] = table#1357 { ["type"] = "literal", ["value"] = "Codes based on complete graphs", ["xml:lang"] = "en", }, }, table#1358 { ["itemType"] = table#1359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q679069", }, ["subjectLabel"] = table#1361 { ["type"] = "literal", ["value"] = "Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems", ["xml:lang"] = "en", }, }, table#1362 { ["itemType"] = table#1363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q681264", }, ["subjectLabel"] = table#1365 { ["type"] = "literal", ["value"] = "Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs", ["xml:lang"] = "en", }, }, table#1366 { ["itemType"] = table#1367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q681756", }, ["subjectLabel"] = table#1369 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing colorings of graphs with maximum average degree less than \$\\frac{37} {12}\$", ["xml:lang"] = "en", }, }, table#1370 { ["itemType"] = table#1371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q681815", }, ["subjectLabel"] = table#1373 { ["type"] = "literal", ["value"] = "Some fixed point theorems in cone modular spaces with a graph", ["xml:lang"] = "en", }, }, table#1374 { ["itemType"] = table#1375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q682856", }, ["subjectLabel"] = table#1377 { ["type"] = "literal", ["value"] = "Consensus in networks with arbitrary time invariant linear agents", ["xml:lang"] = "en", }, }, table#1378 { ["itemType"] = table#1379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q684125", }, ["subjectLabel"] = table#1381 { ["type"] = "literal", ["value"] = "Chords in longest cycles", ["xml:lang"] = "en", }, }, table#1382 { ["itemType"] = table#1383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q686158", }, ["subjectLabel"] = table#1385 { ["type"] = "literal", ["value"] = "Universal cycles of \$k\$-subsets and \$k\$-permutations", ["xml:lang"] = "en", }, }, table#1386 { ["itemType"] = table#1387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q686512", }, ["subjectLabel"] = table#1389 { ["type"] = "literal", ["value"] = "Computation of the 0-dual closure for hamiltonian graphs", ["xml:lang"] = "en", }, }, table#1390 { ["itemType"] = table#1391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q692658", }, ["subjectLabel"] = table#1393 { ["type"] = "literal", ["value"] = "List edge and list total coloring of 1-planar graphs", ["xml:lang"] = "en", }, }, table#1394 { ["itemType"] = table#1395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q692718", }, ["subjectLabel"] = table#1397 { ["type"] = "literal", ["value"] = "On the Seidel integral complete multipartite graphs", ["xml:lang"] = "en", }, }, table#1398 { ["itemType"] = table#1399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q705040", }, ["subjectLabel"] = table#1401 { ["type"] = "literal", ["value"] = "A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs", ["xml:lang"] = "en", }, }, table#1402 { ["itemType"] = table#1403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q705042", }, ["subjectLabel"] = table#1405 { ["type"] = "literal", ["value"] = "On 3-colorings of plane graphs", ["xml:lang"] = "en", }, }, table#1406 { ["itemType"] = table#1407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q705048", }, ["subjectLabel"] = table#1409 { ["type"] = "literal", ["value"] = "Distance between two vertices of maximum matching graphs", ["xml:lang"] = "en", }, }, table#1410 { ["itemType"] = table#1411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q705881", }, ["subjectLabel"] = table#1413 { ["type"] = "literal", ["value"] = "The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits", ["xml:lang"] = "en", }, }, table#1414 { ["itemType"] = table#1415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q710976", }, ["subjectLabel"] = table#1417 { ["type"] = "literal", ["value"] = "On the maximum and minimum Zagreb indices of graphs with connectivity at most \$k\$", ["xml:lang"] = "en", }, }, table#1418 { ["itemType"] = table#1419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q711508", }, ["subjectLabel"] = table#1421 { ["type"] = "literal", ["value"] = "Chromatic sums of 2-edge-connected maps on the projective plane", ["xml:lang"] = "en", }, }, table#1422 { ["itemType"] = table#1423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q711522", }, ["subjectLabel"] = table#1425 { ["type"] = "literal", ["value"] = "Graph partition into \$K_{3}\$s and \$K_{4}\$s", ["xml:lang"] = "en", }, }, table#1426 { ["itemType"] = table#1427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q715627", }, ["subjectLabel"] = table#1429 { ["type"] = "literal", ["value"] = "\$(-2)\$-monohemimorphic graphs", ["xml:lang"] = "en", }, }, table#1430 { ["itemType"] = table#1431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q715739", }, ["subjectLabel"] = table#1433 { ["type"] = "literal", ["value"] = "Spectra of large random trees", ["xml:lang"] = "en", }, }, table#1434 { ["itemType"] = table#1435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q723878", }, ["subjectLabel"] = table#1437 { ["type"] = "literal", ["value"] = "Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk", ["xml:lang"] = "en", }, }, table#1438 { ["itemType"] = table#1439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q726341", }, ["subjectLabel"] = table#1441 { ["type"] = "literal", ["value"] = "Fault-tolerant Hamiltonian connectivity of the WK-recursive networks", ["xml:lang"] = "en", }, }, table#1442 { ["itemType"] = table#1443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q726407", }, ["subjectLabel"] = table#1445 { ["type"] = "literal", ["value"] = "Maximally local connectivity and connected components of augmented cubes", ["xml:lang"] = "en", }, }, table#1446 { ["itemType"] = table#1447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q726494", }, ["subjectLabel"] = table#1449 { ["type"] = "literal", ["value"] = "The nil-graph of ideals of a commutative ring", ["xml:lang"] = "en", }, }, table#1450 { ["itemType"] = table#1451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q726516", }, ["subjectLabel"] = table#1453 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing edge colorings of graphs with small maximum average degree", ["xml:lang"] = "en", }, }, table#1454 { ["itemType"] = table#1455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q726517", }, ["subjectLabel"] = table#1457 { ["type"] = "literal", ["value"] = "On equitable colorings of sparse graphs", ["xml:lang"] = "en", }, }, table#1458 { ["itemType"] = table#1459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q726529", }, ["subjectLabel"] = table#1461 { ["type"] = "literal", ["value"] = "Minimum number of components of 2-factors in iterated line graphs", ["xml:lang"] = "en", }, }, table#1462 { ["itemType"] = table#1463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q730267", }, ["subjectLabel"] = table#1465 { ["type"] = "literal", ["value"] = "The complexity of list edge-partitions for simple graphs", ["xml:lang"] = "en", }, }, table#1466 { ["itemType"] = table#1467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q735403", }, ["subjectLabel"] = table#1469 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups", ["xml:lang"] = "en", }, }, table#1470 { ["itemType"] = table#1471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q740648", }, ["subjectLabel"] = table#1473 { ["type"] = "literal", ["value"] = "Group flow, complex flow, unit vector flow, and the \$(2 + \\epsilon)\$-flow conjecture", ["xml:lang"] = "en", }, }, table#1474 { ["itemType"] = table#1475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q740659", }, ["subjectLabel"] = table#1477 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows of claw-free graphs", ["xml:lang"] = "en", }, }, table#1478 { ["itemType"] = table#1479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q741532", }, ["subjectLabel"] = table#1481 { ["type"] = "literal", ["value"] = "Panconnectivity and edge-pancyclicity of multidimensional torus networks", ["xml:lang"] = "en", }, }, table#1482 { ["itemType"] = table#1483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q741738", }, ["subjectLabel"] = table#1485 { ["type"] = "literal", ["value"] = "Algorithms for unipolar and generalized split graphs", ["xml:lang"] = "en", }, }, table#1486 { ["itemType"] = table#1487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q742593", }, ["subjectLabel"] = table#1489 { ["type"] = "literal", ["value"] = "The chromatic index of a graph whose core is a cycle of order at most 13", ["xml:lang"] = "en", }, }, table#1490 { ["itemType"] = table#1491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q742598", }, ["subjectLabel"] = table#1493 { ["type"] = "literal", ["value"] = "Plane graphs with maximum degree 6 are edge-face 8-colorable", ["xml:lang"] = "en", }, }, table#1494 { ["itemType"] = table#1495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q742616", }, ["subjectLabel"] = table#1497 { ["type"] = "literal", ["value"] = "Maximum degree condition and group connectivity", ["xml:lang"] = "en", }, }, table#1498 { ["itemType"] = table#1499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q745954", }, ["subjectLabel"] = table#1501 { ["type"] = "literal", ["value"] = "Ear decomposition of factor-critical graphs and number of maximum matchings", ["xml:lang"] = "en", }, }, table#1502 { ["itemType"] = table#1503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q746956", }, ["subjectLabel"] = table#1505 { ["type"] = "literal", ["value"] = "Heavy cycles in 2-connected triangle-free weighted graphs", ["xml:lang"] = "en", }, }, table#1506 { ["itemType"] = table#1507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q746958", }, ["subjectLabel"] = table#1509 { ["type"] = "literal", ["value"] = "Acyclic edge coloring of triangle-free 1-planar graphs", ["xml:lang"] = "en", }, }, table#1510 { ["itemType"] = table#1511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q752015", }, ["subjectLabel"] = table#1513 { ["type"] = "literal", ["value"] = "Facets of the clique partitioning polytope", ["xml:lang"] = "en", }, }, table#1514 { ["itemType"] = table#1515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q753823", }, ["subjectLabel"] = table#1517 { ["type"] = "literal", ["value"] = "Equivalent factor matroids of graphs", ["xml:lang"] = "en", }, }, table#1518 { ["itemType"] = table#1519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q755594", }, ["subjectLabel"] = table#1521 { ["type"] = "literal", ["value"] = "\$(0,\\lambda)\$-graphs and \$n\$-cubes", ["xml:lang"] = "en", }, }, table#1522 { ["itemType"] = table#1523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q757438", }, ["subjectLabel"] = table#1525 { ["type"] = "literal", ["value"] = "Minimum degree of bipartite graphs and the existence of k-factors", ["xml:lang"] = "en", }, }, table#1526 { ["itemType"] = table#1527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q762503", }, ["subjectLabel"] = table#1529 { ["type"] = "literal", ["value"] = "Three-regular parts of four-regular graphs", ["xml:lang"] = "en", }, }, table#1530 { ["itemType"] = table#1531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q776260", }, ["subjectLabel"] = table#1533 { ["type"] = "literal", ["value"] = "Locating any two vertices on Hamiltonian cycles in large graphs", ["xml:lang"] = "en", }, }, table#1534 { ["itemType"] = table#1535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q777377", }, ["subjectLabel"] = table#1537 { ["type"] = "literal", ["value"] = "Complexity of planar signed graph homomorphisms to cycles", ["xml:lang"] = "en", }, }, table#1538 { ["itemType"] = table#1539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q777390", }, ["subjectLabel"] = table#1541 { ["type"] = "literal", ["value"] = "Restricted matching in plane triangulations and near triangulations", ["xml:lang"] = "en", }, }, table#1542 { ["itemType"] = table#1543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q777410", }, ["subjectLabel"] = table#1545 { ["type"] = "literal", ["value"] = "On energy and Laplacian energy of chain graphs", ["xml:lang"] = "en", }, }, table#1546 { ["itemType"] = table#1547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q779733", }, ["subjectLabel"] = table#1549 { ["type"] = "literal", ["value"] = "Minimum path cover in quasi-claw-free graphs", ["xml:lang"] = "en", }, }, table#1550 { ["itemType"] = table#1551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q782134", }, ["subjectLabel"] = table#1553 { ["type"] = "literal", ["value"] = "How to contract a vertex transitive 5-connected graph", ["xml:lang"] = "en", }, }, table#1554 { ["itemType"] = table#1555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q782742", }, ["subjectLabel"] = table#1557 { ["type"] = "literal", ["value"] = "A class of exponential neighbourhoods for the quadratic travelling salesman problem", ["xml:lang"] = "en", }, }, table#1558 { ["itemType"] = table#1559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q783162", }, ["subjectLabel"] = table#1561 { ["type"] = "literal", ["value"] = "Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy", ["xml:lang"] = "en", }, }, table#1562 { ["itemType"] = table#1563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q783683", }, ["subjectLabel"] = table#1565 { ["type"] = "literal", ["value"] = "An Ore-type condition for the existence of two disjoint cycles", ["xml:lang"] = "en", }, }, table#1566 { ["itemType"] = table#1567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q785813", }, ["subjectLabel"] = table#1569 { ["type"] = "literal", ["value"] = "Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8", ["xml:lang"] = "en", }, }, table#1570 { ["itemType"] = table#1571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q790841", }, ["subjectLabel"] = table#1573 { ["type"] = "literal", ["value"] = "A note on the decomposition of graphs into isomorphic matchings", ["xml:lang"] = "en", }, }, table#1574 { ["itemType"] = table#1575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q791450", }, ["subjectLabel"] = table#1577 { ["type"] = "literal", ["value"] = "The 'marriage game': An assignment problem with indivisibilities", ["xml:lang"] = "en", }, }, table#1578 { ["itemType"] = table#1579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q792332", }, ["subjectLabel"] = table#1581 { ["type"] = "literal", ["value"] = "Trivalent symmetric graphs of order at most 120", ["xml:lang"] = "en", }, }, table#1582 { ["itemType"] = table#1583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q793051", }, ["subjectLabel"] = table#1585 { ["type"] = "literal", ["value"] = "Are all simple 4-polytopes Hamiltonian?", ["xml:lang"] = "en", }, }, table#1586 { ["itemType"] = table#1587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q798336", }, ["subjectLabel"] = table#1589 { ["type"] = "literal", ["value"] = "Every 4-regular graph plus an edge contains a 3-regular subgraph", ["xml:lang"] = "en", }, }, table#1590 { ["itemType"] = table#1591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q801087", }, ["subjectLabel"] = table#1593 { ["type"] = "literal", ["value"] = "Hamiltonian cycles in cubic 3-connected bipartite planar graphs", ["xml:lang"] = "en", }, }, table#1594 { ["itemType"] = table#1595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q801930", }, ["subjectLabel"] = table#1597 { ["type"] = "literal", ["value"] = "Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton", ["xml:lang"] = "en", }, }, table#1598 { ["itemType"] = table#1599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q802571", }, ["subjectLabel"] = table#1601 { ["type"] = "literal", ["value"] = "Shortest coverings of graphs with cycles", ["xml:lang"] = "en", }, }, table#1602 { ["itemType"] = table#1603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q823239", }, ["subjectLabel"] = table#1605 { ["type"] = "literal", ["value"] = "Networks beyond pairwise interactions: structure and dynamics", ["xml:lang"] = "en", }, }, table#1606 { ["itemType"] = table#1607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q827404", }, ["subjectLabel"] = table#1609 { ["type"] = "literal", ["value"] = "On the normalized Laplacian spectral radii of a graph and its line graph", ["xml:lang"] = "en", }, }, table#1610 { ["itemType"] = table#1611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q828975", }, ["subjectLabel"] = table#1613 { ["type"] = "literal", ["value"] = "Classifying heptavalent symmetric graphs of order \$40p\$", ["xml:lang"] = "en", }, }, table#1614 { ["itemType"] = table#1615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q830575", }, ["subjectLabel"] = table#1617 { ["type"] = "literal", ["value"] = "An algorithm for blocking regular fractional factorial 2-level designs with clear two-factor interactions", ["xml:lang"] = "en", }, }, table#1618 { ["itemType"] = table#1619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q832963", }, ["subjectLabel"] = table#1621 { ["type"] = "literal", ["value"] = "Parikh word representable graphs and morphisms", ["xml:lang"] = "en", }, }, table#1622 { ["itemType"] = table#1623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q832991", }, ["subjectLabel"] = table#1625 { ["type"] = "literal", ["value"] = "The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11", ["xml:lang"] = "en", }, }, table#1626 { ["itemType"] = table#1627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q839379", }, ["subjectLabel"] = table#1629 { ["type"] = "literal", ["value"] = "On the spectral radius of graphs with connectivity at most \$k\$", ["xml:lang"] = "en", }, }, table#1630 { ["itemType"] = table#1631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q839634", }, ["subjectLabel"] = table#1633 { ["type"] = "literal", ["value"] = "Quantum algorithms for matching problems", ["xml:lang"] = "en", }, }, table#1634 { ["itemType"] = table#1635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q844233", }, ["subjectLabel"] = table#1637 { ["type"] = "literal", ["value"] = "Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs", ["xml:lang"] = "en", }, }, table#1638 { ["itemType"] = table#1639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q846815", }, ["subjectLabel"] = table#1641 { ["type"] = "literal", ["value"] = "On \$\\lambda\$-harmonic graphs", ["xml:lang"] = "en", }, }, table#1642 { ["itemType"] = table#1643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q848177", }, ["subjectLabel"] = table#1645 { ["type"] = "literal", ["value"] = "Elementary components of essentially disconnected polyomino graphs", ["xml:lang"] = "en", }, }, table#1646 { ["itemType"] = table#1647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q854458", }, ["subjectLabel"] = table#1649 { ["type"] = "literal", ["value"] = "Edge covering coloring of nearly bipartite graphs", ["xml:lang"] = "en", }, }, table#1650 { ["itemType"] = table#1651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q854573", }, ["subjectLabel"] = table#1653 { ["type"] = "literal", ["value"] = "A lower bound on cochromatic number for line graphs of a kind of graphs", ["xml:lang"] = "en", }, }, table#1654 { ["itemType"] = table#1655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q854642", }, ["subjectLabel"] = table#1657 { ["type"] = "literal", ["value"] = "Minimal regular 2-graphs and applications", ["xml:lang"] = "en", }, }, table#1658 { ["itemType"] = table#1659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q854646", }, ["subjectLabel"] = table#1661 { ["type"] = "literal", ["value"] = "Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen", ["xml:lang"] = "en", }, }, table#1662 { ["itemType"] = table#1663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q855299", }, ["subjectLabel"] = table#1665 { ["type"] = "literal", ["value"] = "On a \$k\$-tree containing specified leaves in a graph", ["xml:lang"] = "en", }, }, table#1666 { ["itemType"] = table#1667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q858340", }, ["subjectLabel"] = table#1669 { ["type"] = "literal", ["value"] = "Modelling complex assemblies as a queueing network for lead time control", ["xml:lang"] = "en", }, }, table#1670 { ["itemType"] = table#1671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q861483", }, ["subjectLabel"] = table#1673 { ["type"] = "literal", ["value"] = "On toughness and \$(g,f)\$-factors in bipartite graphs", ["xml:lang"] = "en", }, }, table#1674 { ["itemType"] = table#1675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q862676", }, ["subjectLabel"] = table#1677 { ["type"] = "literal", ["value"] = "The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs", ["xml:lang"] = "en", }, }, table#1678 { ["itemType"] = table#1679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q862738", }, ["subjectLabel"] = table#1681 { ["type"] = "literal", ["value"] = "Partitioning series-parallel multigraphs into \$v^*\$-excluding edge covers", ["xml:lang"] = "en", }, }, table#1682 { ["itemType"] = table#1683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q862882", }, ["subjectLabel"] = table#1685 { ["type"] = "literal", ["value"] = "On the Randić index of unicyclic conjugated molecules", ["xml:lang"] = "en", }, }, table#1686 { ["itemType"] = table#1687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q864885", }, ["subjectLabel"] = table#1689 { ["type"] = "literal", ["value"] = "Anti-coordination and social interactions", ["xml:lang"] = "en", }, }, table#1690 { ["itemType"] = table#1691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q867765", }, ["subjectLabel"] = table#1693 { ["type"] = "literal", ["value"] = "\$P_{4k-1}\$-factorization of bipartite multigraphs", ["xml:lang"] = "en", }, }, table#1694 { ["itemType"] = table#1695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q867795", }, ["subjectLabel"] = table#1697 { ["type"] = "literal", ["value"] = "\$D(\\beta)\$-vertex-distinguishing total coloring of graphs", ["xml:lang"] = "en", }, }, table#1698 { ["itemType"] = table#1699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q870977", }, ["subjectLabel"] = table#1701 { ["type"] = "literal", ["value"] = "On strong (weak) independent sets and vertex coverings of a graph", ["xml:lang"] = "en", }, }, table#1702 { ["itemType"] = table#1703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q871682", }, ["subjectLabel"] = table#1705 { ["type"] = "literal", ["value"] = "On the upper bounds of the numbers of perfect matchings in graphs with given parameters", ["xml:lang"] = "en", }, }, table#1706 { ["itemType"] = table#1707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q879947", }, ["subjectLabel"] = table#1709 { ["type"] = "literal", ["value"] = "Simple proofs of results on paths representing all colors in proper vertex-colorings", ["xml:lang"] = "en", }, }, table#1710 { ["itemType"] = table#1711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q881594", }, ["subjectLabel"] = table#1713 { ["type"] = "literal", ["value"] = "Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth", ["xml:lang"] = "en", }, }, table#1714 { ["itemType"] = table#1715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q882593", }, ["subjectLabel"] = table#1717 { ["type"] = "literal", ["value"] = "The Merrifield - Simmons indices and Hosoya indices of trees with \$k\$ pendant vertices", ["xml:lang"] = "en", }, }, table#1718 { ["itemType"] = table#1719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q882784", }, ["subjectLabel"] = table#1721 { ["type"] = "literal", ["value"] = "A characterization of graphs without even factors", ["xml:lang"] = "en", }, }, table#1722 { ["itemType"] = table#1723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q884893", }, ["subjectLabel"] = table#1725 { ["type"] = "literal", ["value"] = "\$k\$-factors and Hamilton cycles in graphs", ["xml:lang"] = "en", }, }, table#1726 { ["itemType"] = table#1727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q891319", }, ["subjectLabel"] = table#1729 { ["type"] = "literal", ["value"] = "Decomposition of complete bipartite multigraphs into paths and cycles having \$k\$ edges", ["xml:lang"] = "en", }, }, table#1730 { ["itemType"] = table#1731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q893326", }, ["subjectLabel"] = table#1733 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group", ["xml:lang"] = "en", }, }, table#1734 { ["itemType"] = table#1735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q893494", }, ["subjectLabel"] = table#1737 { ["type"] = "literal", ["value"] = "Domination in 4-regular graphs with girth 3", ["xml:lang"] = "en", }, }, table#1738 { ["itemType"] = table#1739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q894441", }, ["subjectLabel"] = table#1741 { ["type"] = "literal", ["value"] = "The super connectivity of exchanged crossed cube", ["xml:lang"] = "en", }, }, table#1742 { ["itemType"] = table#1743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q894466", }, ["subjectLabel"] = table#1745 { ["type"] = "literal", ["value"] = "Sufficient conditions for triangle-free graphs to be super \$k\$-restricted edge-connected", ["xml:lang"] = "en", }, }, table#1746 { ["itemType"] = table#1747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q896013", }, ["subjectLabel"] = table#1749 { ["type"] = "literal", ["value"] = "The automorphisms of bi-Cayley graphs", ["xml:lang"] = "en", }, }, table#1750 { ["itemType"] = table#1751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q896028", }, ["subjectLabel"] = table#1753 { ["type"] = "literal", ["value"] = "Linear kernel for \\textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique", ["xml:lang"] = "en", }, }, table#1754 { ["itemType"] = table#1755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q896161", }, ["subjectLabel"] = table#1757 { ["type"] = "literal", ["value"] = "Approximation algorithm for the balanced 2-connected \$k\$-partition problem", ["xml:lang"] = "en", }, }, table#1758 { ["itemType"] = table#1759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897239", }, ["subjectLabel"] = table#1761 { ["type"] = "literal", ["value"] = "\$Z_3\$-connectivity of wreath product of graphs", ["xml:lang"] = "en", }, }, table#1762 { ["itemType"] = table#1763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897256", }, ["subjectLabel"] = table#1765 { ["type"] = "literal", ["value"] = "Rainbow numbers for graphs containing small cycles", ["xml:lang"] = "en", }, }, table#1766 { ["itemType"] = table#1767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897267", }, ["subjectLabel"] = table#1769 { ["type"] = "literal", ["value"] = "Fan-type conditions for spanning Eulerian subgraphs", ["xml:lang"] = "en", }, }, table#1770 { ["itemType"] = table#1771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897270", }, ["subjectLabel"] = table#1773 { ["type"] = "literal", ["value"] = "Vertex pancyclicity of quadrangularly connected claw-free graphs", ["xml:lang"] = "en", }, }, table#1774 { ["itemType"] = table#1775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897277", }, ["subjectLabel"] = table#1777 { ["type"] = "literal", ["value"] = "Saturation numbers for linear forests \$P_5\\cup tP_2\$", ["xml:lang"] = "en", }, }, table#1778 { ["itemType"] = table#1779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897281", }, ["subjectLabel"] = table#1781 { ["type"] = "literal", ["value"] = "On the degree distance of unicyclic graphs with given matching number", ["xml:lang"] = "en", }, }, table#1782 { ["itemType"] = table#1783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897286", }, ["subjectLabel"] = table#1785 { ["type"] = "literal", ["value"] = "On three-color Ramsey number of paths", ["xml:lang"] = "en", }, }, table#1786 { ["itemType"] = table#1787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897865", }, ["subjectLabel"] = table#1789 { ["type"] = "literal", ["value"] = "Games on interval and permutation graph representations", ["xml:lang"] = "en", }, }, table#1790 { ["itemType"] = table#1791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q898055", }, ["subjectLabel"] = table#1793 { ["type"] = "literal", ["value"] = "3D shape retrieval using kernels on extended Reeb graphs", ["xml:lang"] = "en", }, }, table#1794 { ["itemType"] = table#1795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q898331", }, ["subjectLabel"] = table#1797 { ["type"] = "literal", ["value"] = "A new relative chain code in 3D", ["xml:lang"] = "en", }, }, table#1798 { ["itemType"] = table#1799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q905706", }, ["subjectLabel"] = table#1801 { ["type"] = "literal", ["value"] = "Relation between signless Laplacian energy, energy of graph and its line graph", ["xml:lang"] = "en", }, }, table#1802 { ["itemType"] = table#1803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q907827", }, ["subjectLabel"] = table#1805 { ["type"] = "literal", ["value"] = "Split Euler tours in 4-regular planar graphs", ["xml:lang"] = "en", }, }, table#1806 { ["itemType"] = table#1807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q907840", }, ["subjectLabel"] = table#1809 { ["type"] = "literal", ["value"] = "A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs", ["xml:lang"] = "en", }, }, table#1810 { ["itemType"] = table#1811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q908052", }, ["subjectLabel"] = table#1813 { ["type"] = "literal", ["value"] = "(Secure) linear network coding multicast", ["xml:lang"] = "en", }, }, table#1814 { ["itemType"] = table#1815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q911763", }, ["subjectLabel"] = table#1817 { ["type"] = "literal", ["value"] = "Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs", ["xml:lang"] = "en", }, }, table#1818 { ["itemType"] = table#1819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q912127", }, ["subjectLabel"] = table#1821 { ["type"] = "literal", ["value"] = "Hamiltonian degree conditions which imply a graph is pancyclic", ["xml:lang"] = "en", }, }, table#1822 { ["itemType"] = table#1823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q912615", }, ["subjectLabel"] = table#1825 { ["type"] = "literal", ["value"] = "The complexity of regular subgraph recognition", ["xml:lang"] = "en", }, }, table#1826 { ["itemType"] = table#1827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q913815", }, ["subjectLabel"] = table#1829 { ["type"] = "literal", ["value"] = "Implicit-degrees and circumferences", ["xml:lang"] = "en", }, }, table#1830 { ["itemType"] = table#1831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q913818", }, ["subjectLabel"] = table#1833 { ["type"] = "literal", ["value"] = "Non-separating cycles and discrete Jordan curves", ["xml:lang"] = "en", }, }, table#1834 { ["itemType"] = table#1835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q913820", }, ["subjectLabel"] = table#1837 { ["type"] = "literal", ["value"] = "Symmetric vertex partitions of hypercubes by isometric trees", ["xml:lang"] = "en", }, }, table#1838 { ["itemType"] = table#1839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q918993", }, ["subjectLabel"] = table#1841 { ["type"] = "literal", ["value"] = "The matching extendability of surfaces", ["xml:lang"] = "en", }, }, table#1842 { ["itemType"] = table#1843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q922553", }, ["subjectLabel"] = table#1845 { ["type"] = "literal", ["value"] = "Edge reductions in cyclically \$k\$-connected cubic graphs", ["xml:lang"] = "en", }, }, table#1846 { ["itemType"] = table#1847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q922555", }, ["subjectLabel"] = table#1849 { ["type"] = "literal", ["value"] = "Factorizations of regular graphs", ["xml:lang"] = "en", }, }, table#1850 { ["itemType"] = table#1851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q925977", }, ["subjectLabel"] = table#1853 { ["type"] = "literal", ["value"] = "AVDTC numbers of generalized Halin graphs with maximum degree at least 6", ["xml:lang"] = "en", }, }, table#1854 { ["itemType"] = table#1855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q926907", }, ["subjectLabel"] = table#1857 { ["type"] = "literal", ["value"] = "PI indices of pericondensed benzenoid graphs", ["xml:lang"] = "en", }, }, table#1858 { ["itemType"] = table#1859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q926924", }, ["subjectLabel"] = table#1861 { ["type"] = "literal", ["value"] = "Unicycle graphs with extremal Merrifield-Simmons index", ["xml:lang"] = "en", }, }, table#1862 { ["itemType"] = table#1863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q926939", }, ["subjectLabel"] = table#1865 { ["type"] = "literal", ["value"] = "On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter", ["xml:lang"] = "en", }, }, table#1866 { ["itemType"] = table#1867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q927158", }, ["subjectLabel"] = table#1869 { ["type"] = "literal", ["value"] = "The complexity of recognizing linear systems with certain integrality properties", ["xml:lang"] = "en", }, }, table#1870 { ["itemType"] = table#1871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q928245", }, ["subjectLabel"] = table#1873 { ["type"] = "literal", ["value"] = "On edge singularity and eigenvectors of mixed graphs", ["xml:lang"] = "en", }, }, table#1874 { ["itemType"] = table#1875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q931507", }, ["subjectLabel"] = table#1877 { ["type"] = "literal", ["value"] = "On the adjacent-vertex-strongly-distinguishing total coloring of graphs", ["xml:lang"] = "en", }, }, table#1878 { ["itemType"] = table#1879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q932658", }, ["subjectLabel"] = table#1881 { ["type"] = "literal", ["value"] = "On the adjacent vertex distinguishing total coloring numbers of graphs with \$\\varDelta =3\$", ["xml:lang"] = "en", }, }, table#1882 { ["itemType"] = table#1883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q937248", }, ["subjectLabel"] = table#1885 { ["type"] = "literal", ["value"] = "Path-factors in the square of a tree", ["xml:lang"] = "en", }, }, table#1886 { ["itemType"] = table#1887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q937252", }, ["subjectLabel"] = table#1889 { ["type"] = "literal", ["value"] = "Total colorings of planar graphs without small cycles", ["xml:lang"] = "en", }, }, table#1890 { ["itemType"] = table#1891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q937401", }, ["subjectLabel"] = table#1893 { ["type"] = "literal", ["value"] = "Approximability results for the maximum and minimum maximal induced matching problems", ["xml:lang"] = "en", }, }, table#1894 { ["itemType"] = table#1895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q937620", }, ["subjectLabel"] = table#1897 { ["type"] = "literal", ["value"] = "The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices", ["xml:lang"] = "en", }, }, table#1898 { ["itemType"] = table#1899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q937627", }, ["subjectLabel"] = table#1901 { ["type"] = "literal", ["value"] = "Hosoya index of unicyclic graphs with prescribed pendent vertices", ["xml:lang"] = "en", }, }, table#1902 { ["itemType"] = table#1903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q943436", }, ["subjectLabel"] = table#1905 { ["type"] = "literal", ["value"] = "Bounds on the clique-transversal number of regular graphs", ["xml:lang"] = "en", }, }, table#1906 { ["itemType"] = table#1907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q944739", }, ["subjectLabel"] = table#1909 { ["type"] = "literal", ["value"] = "Graph parameters measuring neighbourhoods in graphs-bounds and applications", ["xml:lang"] = "en", }, }, table#1910 { ["itemType"] = table#1911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q947732", }, ["subjectLabel"] = table#1913 { ["type"] = "literal", ["value"] = "A classification of tightly attached half-arc-transitive graphs of valency 4", ["xml:lang"] = "en", }, }, table#1914 { ["itemType"] = table#1915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q948701", }, ["subjectLabel"] = table#1917 { ["type"] = "literal", ["value"] = "A note on the signed edge domination number in graphs", ["xml:lang"] = "en", }, }, table#1918 { ["itemType"] = table#1919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q949291", }, ["subjectLabel"] = table#1921 { ["type"] = "literal", ["value"] = "Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph", ["xml:lang"] = "en", }, }, table#1922 { ["itemType"] = table#1923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q949343", }, ["subjectLabel"] = table#1925 { ["type"] = "literal", ["value"] = "Removable edges of cycles in 5-connected graphs", ["xml:lang"] = "en", }, }, table#1926 { ["itemType"] = table#1927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q949915", }, ["subjectLabel"] = table#1929 { ["type"] = "literal", ["value"] = "Sequence trajectory generation for garment handling systems", ["xml:lang"] = "en", }, }, table#1930 { ["itemType"] = table#1931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q950323", }, ["subjectLabel"] = table#1933 { ["type"] = "literal", ["value"] = "The basis number of the Cartesian product of stars and wheels with different ladders", ["xml:lang"] = "en", }, }, table#1934 { ["itemType"] = table#1935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q950676", }, ["subjectLabel"] = table#1937 { ["type"] = "literal", ["value"] = "Short cycle structure of graphs on surfaces. I: The uniqueness theorems", ["xml:lang"] = "en", }, }, table#1938 { ["itemType"] = table#1939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q952644", }, ["subjectLabel"] = table#1941 { ["type"] = "literal", ["value"] = "Lower bounds on several versions of signed domination number", ["xml:lang"] = "en", }, }, table#1942 { ["itemType"] = table#1943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q954967", }, ["subjectLabel"] = table#1945 { ["type"] = "literal", ["value"] = "Complexity results for three-dimensional orthogonal graph drawing", ["xml:lang"] = "en", }, }, table#1946 { ["itemType"] = table#1947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q966486", }, ["subjectLabel"] = table#1949 { ["type"] = "literal", ["value"] = "Degree with neighborhood conditions and highly Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#1950 { ["itemType"] = table#1951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q966542", }, ["subjectLabel"] = table#1953 { ["type"] = "literal", ["value"] = "Panconnectivity for interconnection networks with faulty elements", ["xml:lang"] = "en", }, }, table#1954 { ["itemType"] = table#1955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q966553", }, ["subjectLabel"] = table#1957 { ["type"] = "literal", ["value"] = "Hamiltonicity of 4-connected graphs", ["xml:lang"] = "en", }, }, table#1958 { ["itemType"] = table#1959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q968225", }, ["subjectLabel"] = table#1961 { ["type"] = "literal", ["value"] = "Matching properties in total domination vertex critical graphs", ["xml:lang"] = "en", }, }, table#1962 { ["itemType"] = table#1963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q968444", }, ["subjectLabel"] = table#1965 { ["type"] = "literal", ["value"] = "On extremal weighted digraphs with no heavy paths", ["xml:lang"] = "en", }, }, table#1966 { ["itemType"] = table#1967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q970473", }, ["subjectLabel"] = table#1969 { ["type"] = "literal", ["value"] = "On the extremal Zagreb indices of graphs with cut edges", ["xml:lang"] = "en", }, }, table#1970 { ["itemType"] = table#1971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q803145", }, ["subjectLabel"] = table#1973 { ["type"] = "literal", ["value"] = "The search for chromatically unique graphs", ["xml:lang"] = "en", }, }, table#1974 { ["itemType"] = table#1975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q803159", }, ["subjectLabel"] = table#1977 { ["type"] = "literal", ["value"] = "Pancyclism in hamiltonian graphs", ["xml:lang"] = "en", }, }, table#1978 { ["itemType"] = table#1979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q803161", }, ["subjectLabel"] = table#1981 { ["type"] = "literal", ["value"] = "Toughness and Delaunay triangulations", ["xml:lang"] = "en", }, }, table#1982 { ["itemType"] = table#1983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q804018", }, ["subjectLabel"] = table#1985 { ["type"] = "literal", ["value"] = "Topological aspects of edge fusions in 4-graphs", ["xml:lang"] = "en", }, }, table#1986 { ["itemType"] = table#1987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q805628", }, ["subjectLabel"] = table#1989 { ["type"] = "literal", ["value"] = "How to make a graph bipartite", ["xml:lang"] = "en", }, }, table#1990 { ["itemType"] = table#1991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q808149", }, ["subjectLabel"] = table#1993 { ["type"] = "literal", ["value"] = "Natural and smoothing quadratic spline. (An elementary approach)", ["xml:lang"] = "en", }, }, table#1994 { ["itemType"] = table#1995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q810533", }, ["subjectLabel"] = table#1997 { ["type"] = "literal", ["value"] = "Clique-transversal sets of line graphs and complements of line graphs", ["xml:lang"] = "en", }, }, table#1998 { ["itemType"] = table#1999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q815980", }, ["subjectLabel"] = table#2001 { ["type"] = "literal", ["value"] = "Circular list colorings of some graphs", ["xml:lang"] = "en", }, }, table#2002 { ["itemType"] = table#2003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1113914", }, ["subjectLabel"] = table#2005 { ["type"] = "literal", ["value"] = "INGRID: A graph invariant manipulator", ["xml:lang"] = "en", }, }, table#2006 { ["itemType"] = table#2007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1114415", }, ["subjectLabel"] = table#2009 { ["type"] = "literal", ["value"] = "An efficient parallel algorithm for planarity", ["xml:lang"] = "en", }, }, table#2010 { ["itemType"] = table#2011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1114706", }, ["subjectLabel"] = table#2013 { ["type"] = "literal", ["value"] = "Digraphs with degree equivalent induced subdigraphs", ["xml:lang"] = "en", }, }, table#2014 { ["itemType"] = table#2015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1114713", }, ["subjectLabel"] = table#2017 { ["type"] = "literal", ["value"] = "Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)", ["xml:lang"] = "en", }, }, table#2018 { ["itemType"] = table#2019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1116953", }, ["subjectLabel"] = table#2021 { ["type"] = "literal", ["value"] = "Reducing prime graphs and recognizing circle graphs", ["xml:lang"] = "en", }, }, table#2022 { ["itemType"] = table#2023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1118820", }, ["subjectLabel"] = table#2025 { ["type"] = "literal", ["value"] = "Some extremal results on circles containing points", ["xml:lang"] = "en", }, }, table#2026 { ["itemType"] = table#2027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1119605", }, ["subjectLabel"] = table#2029 { ["type"] = "literal", ["value"] = "The total interval number of a graph", ["xml:lang"] = "en", }, }, table#2030 { ["itemType"] = table#2031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1120154", }, ["subjectLabel"] = table#2033 { ["type"] = "literal", ["value"] = "On the fundamental group of 3-gems and a `planar' class of 3-manifolds", ["xml:lang"] = "en", }, }, table#2034 { ["itemType"] = table#2035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1120581", }, ["subjectLabel"] = table#2037 { ["type"] = "literal", ["value"] = "The linear arboricity of graphs", ["xml:lang"] = "en", }, }, table#2038 { ["itemType"] = table#2039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1120592", }, ["subjectLabel"] = table#2041 { ["type"] = "literal", ["value"] = "Non-Hamiltonian bicubic graphs", ["xml:lang"] = "en", }, }, table#2042 { ["itemType"] = table#2043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1121914", }, ["subjectLabel"] = table#2045 { ["type"] = "literal", ["value"] = "On dimensional properties of graphs", ["xml:lang"] = "en", }, }, table#2046 { ["itemType"] = table#2047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1122492", }, ["subjectLabel"] = table#2049 { ["type"] = "literal", ["value"] = "A cutting plane algorithm for a clustering problem", ["xml:lang"] = "en", }, }, table#2050 { ["itemType"] = table#2051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1126183", }, ["subjectLabel"] = table#2053 { ["type"] = "literal", ["value"] = "Strong edge colorings of graphs", ["xml:lang"] = "en", }, }, table#2054 { ["itemType"] = table#2055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1128115", }, ["subjectLabel"] = table#2057 { ["type"] = "literal", ["value"] = "\$(g,f)\$-factorizations orthogonal to a subgraph of a graph", ["xml:lang"] = "en", }, }, table#2058 { ["itemType"] = table#2059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1128130", }, ["subjectLabel"] = table#2061 { ["type"] = "literal", ["value"] = "Upper embeddability of graphs", ["xml:lang"] = "en", }, }, table#2062 { ["itemType"] = table#2063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1128610", }, ["subjectLabel"] = table#2065 { ["type"] = "literal", ["value"] = "Learning metric-topological maps for indoor mobile robot navigation", ["xml:lang"] = "en", }, }, table#2066 { ["itemType"] = table#2067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1132888", }, ["subjectLabel"] = table#2069 { ["type"] = "literal", ["value"] = "Special subdivisions of \$K_4\$ and 4-chromatic graphs", ["xml:lang"] = "en", }, }, table#2070 { ["itemType"] = table#2071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1135865", }, ["subjectLabel"] = table#2073 { ["type"] = "literal", ["value"] = "Finite common coverings of pairs of regular graphs", ["xml:lang"] = "en", }, }, table#2074 { ["itemType"] = table#2075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1137596", }, ["subjectLabel"] = table#2077 { ["type"] = "literal", ["value"] = "Symmetries of directed graphs and the chinese remainder theorem", ["xml:lang"] = "en", }, }, table#2078 { ["itemType"] = table#2079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1142781", }, ["subjectLabel"] = table#2081 { ["type"] = "literal", ["value"] = "Planarity and duality of finite and infinite graphs", ["xml:lang"] = "en", }, }, table#2082 { ["itemType"] = table#2083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1148325", }, ["subjectLabel"] = table#2085 { ["type"] = "literal", ["value"] = "Critical hypergraphs for the weak chromatic number", ["xml:lang"] = "en", }, }, table#2086 { ["itemType"] = table#2087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1150377", }, ["subjectLabel"] = table#2089 { ["type"] = "literal", ["value"] = "Non-separating induced cycles in graphs", ["xml:lang"] = "en", }, }, table#2090 { ["itemType"] = table#2091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1150627", }, ["subjectLabel"] = table#2093 { ["type"] = "literal", ["value"] = "A bound on the chromatic number of graphs without certain induced subgraphs", ["xml:lang"] = "en", }, }, table#2094 { ["itemType"] = table#2095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1154474", }, ["subjectLabel"] = table#2097 { ["type"] = "literal", ["value"] = "Graph-encoded maps", ["xml:lang"] = "en", }, }, table#2098 { ["itemType"] = table#2099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1155624", }, ["subjectLabel"] = table#2101 { ["type"] = "literal", ["value"] = "Vector transversals", ["xml:lang"] = "en", }, }, table#2102 { ["itemType"] = table#2103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1158162", }, ["subjectLabel"] = table#2105 { ["type"] = "literal", ["value"] = "Edge partitions of the complete symmetric directed graph and related designs", ["xml:lang"] = "en", }, }, table#2106 { ["itemType"] = table#2107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1159691", }, ["subjectLabel"] = table#2109 { ["type"] = "literal", ["value"] = "On the number of complete subgraphs contained in certain graphs", ["xml:lang"] = "en", }, }, table#2110 { ["itemType"] = table#2111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1160145", }, ["subjectLabel"] = table#2113 { ["type"] = "literal", ["value"] = "Rings of bonds in graphs", ["xml:lang"] = "en", }, }, table#2114 { ["itemType"] = table#2115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1164056", }, ["subjectLabel"] = table#2117 { ["type"] = "literal", ["value"] = "Extending an extension of Grinberg's theorem", ["xml:lang"] = "en", }, }, table#2118 { ["itemType"] = table#2119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1164645", }, ["subjectLabel"] = table#2121 { ["type"] = "literal", ["value"] = "On two-factors of bipartite regular graphs", ["xml:lang"] = "en", }, }, table#2122 { ["itemType"] = table#2123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1165863", }, ["subjectLabel"] = table#2125 { ["type"] = "literal", ["value"] = "Completely strong path-connected tournaments", ["xml:lang"] = "en", }, }, table#2126 { ["itemType"] = table#2127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1165867", }, ["subjectLabel"] = table#2129 { ["type"] = "literal", ["value"] = "A nine point theorem for 3-connected graphs", ["xml:lang"] = "en", }, }, table#2130 { ["itemType"] = table#2131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1166539", }, ["subjectLabel"] = table#2133 { ["type"] = "literal", ["value"] = "Smallest maximally nonhamiltonian graphs", ["xml:lang"] = "en", }, }, table#2134 { ["itemType"] = table#2135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1167184", }, ["subjectLabel"] = table#2137 { ["type"] = "literal", ["value"] = "Alternating cycles in edge-partitioned graphs", ["xml:lang"] = "en", }, }, table#2138 { ["itemType"] = table#2139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1167190", }, ["subjectLabel"] = table#2141 { ["type"] = "literal", ["value"] = "Minimal decompositions of graphs into mutually isomorphic subgraphs", ["xml:lang"] = "en", }, }, table#2142 { ["itemType"] = table#2143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1167741", }, ["subjectLabel"] = table#2145 { ["type"] = "literal", ["value"] = "The splittance of a graph", ["xml:lang"] = "en", }, }, table#2146 { ["itemType"] = table#2147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1168977", }, ["subjectLabel"] = table#2149 { ["type"] = "literal", ["value"] = "Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs", ["xml:lang"] = "en", }, }, table#2150 { ["itemType"] = table#2151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1170256", }, ["subjectLabel"] = table#2153 { ["type"] = "literal", ["value"] = "Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs", ["xml:lang"] = "en", }, }, table#2154 { ["itemType"] = table#2155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171390", }, ["subjectLabel"] = table#2157 { ["type"] = "literal", ["value"] = "Depth-first search and the vertex cover problem", ["xml:lang"] = "en", }, }, table#2158 { ["itemType"] = table#2159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1172068", }, ["subjectLabel"] = table#2161 { ["type"] = "literal", ["value"] = "k-optimal partitions of a directed graph", ["xml:lang"] = "en", }, }, table#2162 { ["itemType"] = table#2163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1172650", }, ["subjectLabel"] = table#2165 { ["type"] = "literal", ["value"] = "An edge-deletion problem for locally finite graphs", ["xml:lang"] = "en", }, }, table#2166 { ["itemType"] = table#2167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1172653", }, ["subjectLabel"] = table#2169 { ["type"] = "literal", ["value"] = "The basis number of the \$n\$-cube", ["xml:lang"] = "en", }, }, table#2170 { ["itemType"] = table#2171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1174334", }, ["subjectLabel"] = table#2173 { ["type"] = "literal", ["value"] = "On the thickness of graphs of given degree", ["xml:lang"] = "en", }, }, table#2174 { ["itemType"] = table#2175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1175559", }, ["subjectLabel"] = table#2177 { ["type"] = "literal", ["value"] = "Non removable edges in 3-connected cubic graphs", ["xml:lang"] = "en", }, }, table#2178 { ["itemType"] = table#2179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1179465", }, ["subjectLabel"] = table#2181 { ["type"] = "literal", ["value"] = "On a generalization of a theorem of Nash-Williams", ["xml:lang"] = "en", }, }, table#2182 { ["itemType"] = table#2183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1180433", }, ["subjectLabel"] = table#2185 { ["type"] = "literal", ["value"] = "Tutte-Martin polynomials and orienting vectors of isotropic systems", ["xml:lang"] = "en", }, }, table#2186 { ["itemType"] = table#2187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1180435", }, ["subjectLabel"] = table#2189 { ["type"] = "literal", ["value"] = "Cycles through three vertices in 2-connected graphs", ["xml:lang"] = "en", }, }, table#2190 { ["itemType"] = table#2191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1182981", }, ["subjectLabel"] = table#2193 { ["type"] = "literal", ["value"] = "Hamiltonian properties of graphs with large neighborhood unions", ["xml:lang"] = "en", }, }, table#2194 { ["itemType"] = table#2195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1183372", }, ["subjectLabel"] = table#2197 { ["type"] = "literal", ["value"] = "Knowledge representation for mathematical discovery: Three experiments in graph theory", ["xml:lang"] = "en", }, }, table#2198 { ["itemType"] = table#2199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1184343", }, ["subjectLabel"] = table#2201 { ["type"] = "literal", ["value"] = "The traveling salesman problem in graphs with some excluded minors", ["xml:lang"] = "en", }, }, table#2202 { ["itemType"] = table#2203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1186134", }, ["subjectLabel"] = table#2205 { ["type"] = "literal", ["value"] = "Hamiltonicity in claw-free graphs", ["xml:lang"] = "en", }, }, table#2206 { ["itemType"] = table#2207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1187389", }, ["subjectLabel"] = table#2209 { ["type"] = "literal", ["value"] = "Row-stochastic matrices with a common left fixed vector", ["xml:lang"] = "en", }, }, table#2210 { ["itemType"] = table#2211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196167", }, ["subjectLabel"] = table#2213 { ["type"] = "literal", ["value"] = "Tight integral duality gap in the Chinese postman problem", ["xml:lang"] = "en", }, }, table#2214 { ["itemType"] = table#2215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196453", }, ["subjectLabel"] = table#2217 { ["type"] = "literal", ["value"] = "Canonical representations of partial 2- and 3-trees", ["xml:lang"] = "en", }, }, table#2218 { ["itemType"] = table#2219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196563", }, ["subjectLabel"] = table#2221 { ["type"] = "literal", ["value"] = "Total colorings of graphs of order \$2n\$ having maximum degree \$2n-2\$", ["xml:lang"] = "en", }, }, table#2222 { ["itemType"] = table#2223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1197009", }, ["subjectLabel"] = table#2225 { ["type"] = "literal", ["value"] = "Coflow polyhedra", ["xml:lang"] = "en", }, }, table#2226 { ["itemType"] = table#2227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1197026", }, ["subjectLabel"] = table#2229 { ["type"] = "literal", ["value"] = "An extension of the multi-path algorithm for finding Hamilton cycles", ["xml:lang"] = "en", }, }, table#2230 { ["itemType"] = table#2231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1198736", }, ["subjectLabel"] = table#2233 { ["type"] = "literal", ["value"] = "A cutting plane algorithm for the windy postman problem", ["xml:lang"] = "en", }, }, table#2234 { ["itemType"] = table#2235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1199123", }, ["subjectLabel"] = table#2237 { ["type"] = "literal", ["value"] = "Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems", ["xml:lang"] = "en", }, }, table#2238 { ["itemType"] = table#2239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1199463", }, ["subjectLabel"] = table#2241 { ["type"] = "literal", ["value"] = "Fast detection and display of symmetry in outerplanar graphs", ["xml:lang"] = "en", }, }, table#2242 { ["itemType"] = table#2243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1200309", }, ["subjectLabel"] = table#2245 { ["type"] = "literal", ["value"] = "Varieties of quasigroups arising from 2-perfect \$m\$-cycle systems", ["xml:lang"] = "en", }, }, table#2246 { ["itemType"] = table#2247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1203103", }, ["subjectLabel"] = table#2249 { ["type"] = "literal", ["value"] = "The complexity of reconstructing trees from qualitative characters and subtrees", ["xml:lang"] = "en", }, }, table#2250 { ["itemType"] = table#2251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1204466", }, ["subjectLabel"] = table#2253 { ["type"] = "literal", ["value"] = "The bounded chromatic number for graphs of genus \$g\$", ["xml:lang"] = "en", }, }, table#2254 { ["itemType"] = table#2255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1204467", }, ["subjectLabel"] = table#2257 { ["type"] = "literal", ["value"] = "Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties", ["xml:lang"] = "en", }, }, table#2258 { ["itemType"] = table#2259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1204470", }, ["subjectLabel"] = table#2261 { ["type"] = "literal", ["value"] = "A note on the \$f\$-factor-lattice of bipartite graphs", ["xml:lang"] = "en", }, }, table#2262 { ["itemType"] = table#2263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1206436", }, ["subjectLabel"] = table#2265 { ["type"] = "literal", ["value"] = "Duality of constrained Voronoi diagrams and Delaunay triangulations", ["xml:lang"] = "en", }, }, table#2266 { ["itemType"] = table#2267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1210301", }, ["subjectLabel"] = table#2269 { ["type"] = "literal", ["value"] = "Undirected edge geography", ["xml:lang"] = "en", }, }, table#2270 { ["itemType"] = table#2271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1227745", }, ["subjectLabel"] = table#2273 { ["type"] = "literal", ["value"] = "On a conjecture of Tutte concerning minimal tree numbers", ["xml:lang"] = "en", }, }, table#2274 { ["itemType"] = table#2275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1245977", }, ["subjectLabel"] = table#2277 { ["type"] = "literal", ["value"] = "Extremal graphs with prescribed covering number", ["xml:lang"] = "en", }, }, table#2278 { ["itemType"] = table#2279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1246543", }, ["subjectLabel"] = table#2281 { ["type"] = "literal", ["value"] = "The chromatic difference sequence of a graph", ["xml:lang"] = "en", }, }, table#2282 { ["itemType"] = table#2283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1249182", }, ["subjectLabel"] = table#2285 { ["type"] = "literal", ["value"] = "The basis number of a graph", ["xml:lang"] = "en", }, }, table#2286 { ["itemType"] = table#2287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1252872", }, ["subjectLabel"] = table#2289 { ["type"] = "literal", ["value"] = "A note on 1-factors in graphs", ["xml:lang"] = "en", }, }, table#2290 { ["itemType"] = table#2291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1253262", }, ["subjectLabel"] = table#2293 { ["type"] = "literal", ["value"] = "Über Hamiltonsche Kreise und unabhängige Ecken in Graphen", ["xml:lang"] = "en", }, }, table#2294 { ["itemType"] = table#2295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1262315", }, ["subjectLabel"] = table#2297 { ["type"] = "literal", ["value"] = "Some extremal connectivity results for matroids", ["xml:lang"] = "en", }, }, table#2298 { ["itemType"] = table#2299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1262876", }, ["subjectLabel"] = table#2301 { ["type"] = "literal", ["value"] = "Distribution of contractible edges in k-connected graphs", ["xml:lang"] = "en", }, }, table#2302 { ["itemType"] = table#2303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1288297", }, ["subjectLabel"] = table#2305 { ["type"] = "literal", ["value"] = "The list chromatic numbers of some planar graphs", ["xml:lang"] = "en", }, }, table#2306 { ["itemType"] = table#2307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1288440", }, ["subjectLabel"] = table#2309 { ["type"] = "literal", ["value"] = "The twisted-cube connected networks", ["xml:lang"] = "en", }, }, table#2310 { ["itemType"] = table#2311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1296143", }, ["subjectLabel"] = table#2313 { ["type"] = "literal", ["value"] = "Symmetric flows and broadcasting in hypercubes", ["xml:lang"] = "en", }, }, table#2314 { ["itemType"] = table#2315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1296153", }, ["subjectLabel"] = table#2317 { ["type"] = "literal", ["value"] = "Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François)", ["xml:lang"] = "en", }, }, table#2318 { ["itemType"] = table#2319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1299831", }, ["subjectLabel"] = table#2321 { ["type"] = "literal", ["value"] = "On number of leaves and bandwidth of trees", ["xml:lang"] = "en", }, }, table#2322 { ["itemType"] = table#2323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1299840", }, ["subjectLabel"] = table#2325 { ["type"] = "literal", ["value"] = "Extensions on 2-edge connected 3-regular up-embeddable graphs", ["xml:lang"] = "en", }, }, table#2326 { ["itemType"] = table#2327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1299861", }, ["subjectLabel"] = table#2329 { ["type"] = "literal", ["value"] = "On connected factors in \$K_{1,3}\$-free graphs", ["xml:lang"] = "en", }, }, table#2330 { ["itemType"] = table#2331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1301661", }, ["subjectLabel"] = table#2333 { ["type"] = "literal", ["value"] = "The strong Hall property and symmetric chain orders", ["xml:lang"] = "en", }, }, table#2334 { ["itemType"] = table#2335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1301670", }, ["subjectLabel"] = table#2337 { ["type"] = "literal", ["value"] = "Panconnectivity of locally connected claw-free graphs", ["xml:lang"] = "en", }, }, table#2338 { ["itemType"] = table#2339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1301716", }, ["subjectLabel"] = table#2341 { ["type"] = "literal", ["value"] = "A generalization of the Doyen-Wilson theorem for extended triple systems of all indices", ["xml:lang"] = "en", }, }, table#2342 { ["itemType"] = table#2343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1301830", }, ["subjectLabel"] = table#2345 { ["type"] = "literal", ["value"] = "Some properties of 3-domination-critical graphs", ["xml:lang"] = "en", }, }, table#2346 { ["itemType"] = table#2347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1304486", }, ["subjectLabel"] = table#2349 { ["type"] = "literal", ["value"] = "A short proof of a conjecture on the \$T_r\$-choice number of even cycles", ["xml:lang"] = "en", }, }, table#2350 { ["itemType"] = table#2351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1305526", }, ["subjectLabel"] = table#2353 { ["type"] = "literal", ["value"] = "The 4-choosability of plane graphs without 4-cycles", ["xml:lang"] = "en", }, }, table#2354 { ["itemType"] = table#2355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1305529", }, ["subjectLabel"] = table#2357 { ["type"] = "literal", ["value"] = "Tetravalent graphs admitting half-transitive group actions: Alternating cycles", ["xml:lang"] = "en", }, }, table#2358 { ["itemType"] = table#2359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1305536", }, ["subjectLabel"] = table#2361 { ["type"] = "literal", ["value"] = "On the vertex-distinguishing proper edge-colorings of graphs", ["xml:lang"] = "en", }, }, table#2362 { ["itemType"] = table#2363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1306618", }, ["subjectLabel"] = table#2365 { ["type"] = "literal", ["value"] = "Restricted random walks on a graph", ["xml:lang"] = "en", }, }, table#2366 { ["itemType"] = table#2367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1306933", }, ["subjectLabel"] = table#2369 { ["type"] = "literal", ["value"] = "Weakly flag-transitive configurations and half-arc-transitive graphs", ["xml:lang"] = "en", }, }, table#2370 { ["itemType"] = table#2371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1312086", }, ["subjectLabel"] = table#2373 { ["type"] = "literal", ["value"] = "A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix", ["xml:lang"] = "en", }, }, table#2374 { ["itemType"] = table#2375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317474", }, ["subjectLabel"] = table#2377 { ["type"] = "literal", ["value"] = "Flow in planar graphs with vertex capacities", ["xml:lang"] = "en", }, }, table#2378 { ["itemType"] = table#2379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317488", }, ["subjectLabel"] = table#2381 { ["type"] = "literal", ["value"] = "Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs", ["xml:lang"] = "en", }, }, table#2382 { ["itemType"] = table#2383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1318824", }, ["subjectLabel"] = table#2385 { ["type"] = "literal", ["value"] = "On \$K_{1,k}\$-factorizations of a complete bipartite graph", ["xml:lang"] = "en", }, }, table#2386 { ["itemType"] = table#2387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1321553", }, ["subjectLabel"] = table#2389 { ["type"] = "literal", ["value"] = "Decoding perfect maps", ["xml:lang"] = "en", }, }, table#2390 { ["itemType"] = table#2391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1322186", }, ["subjectLabel"] = table#2393 { ["type"] = "literal", ["value"] = "The antipodal layers problem", ["xml:lang"] = "en", }, }, table#2394 { ["itemType"] = table#2395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1322206", }, ["subjectLabel"] = table#2397 { ["type"] = "literal", ["value"] = "On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles", ["xml:lang"] = "en", }, }, table#2398 { ["itemType"] = table#2399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1322570", }, ["subjectLabel"] = table#2401 { ["type"] = "literal", ["value"] = "Edge crossings in drawings of bipartite graphs", ["xml:lang"] = "en", }, }, table#2402 { ["itemType"] = table#2403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6096363", }, ["subjectLabel"] = table#2405 { ["type"] = "literal", ["value"] = "On strong Menger connectivity of \$(n,k)\$-bubble-sort networks", ["xml:lang"] = "en", }, }, table#2406 { ["itemType"] = table#2407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6097362", }, ["subjectLabel"] = table#2409 { ["type"] = "literal", ["value"] = "The \$A_{\\alpha}\$-spectral radius of bicyclic graphs with given degree sequences", ["xml:lang"] = "en", }, }, table#2410 { ["itemType"] = table#2411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6098090", }, ["subjectLabel"] = table#2413 { ["type"] = "literal", ["value"] = "Unimodality and monotonic portions of certain domination polynomials", ["xml:lang"] = "en", }, }, table#2414 { ["itemType"] = table#2415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6099017", }, ["subjectLabel"] = table#2417 { ["type"] = "literal", ["value"] = "The influence of social embedding on belief system and its application in online public opinion guidance", ["xml:lang"] = "en", }, }, table#2418 { ["itemType"] = table#2419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6099758", }, ["subjectLabel"] = table#2421 { ["type"] = "literal", ["value"] = "Book thickness of the non-zero component union graph of the finite dimensional vector space", ["xml:lang"] = "en", }, }, table#2422 { ["itemType"] = table#2423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6100419", }, ["subjectLabel"] = table#2425 { ["type"] = "literal", ["value"] = "Star-factorization of the complete bipartite multigraphs", ["xml:lang"] = "en", }, }, table#2426 { ["itemType"] = table#2427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6101475", }, ["subjectLabel"] = table#2429 { ["type"] = "literal", ["value"] = "On the products of group vertex magic graphs", ["xml:lang"] = "en", }, }, table#2430 { ["itemType"] = table#2431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6102214", }, ["subjectLabel"] = table#2433 { ["type"] = "literal", ["value"] = "The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs", ["xml:lang"] = "en", }, }, table#2434 { ["itemType"] = table#2435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6102238", }, ["subjectLabel"] = table#2437 { ["type"] = "literal", ["value"] = "The maximum Laplacian Estrada index of connected graphs", ["xml:lang"] = "en", }, }, table#2438 { ["itemType"] = table#2439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6103302", }, ["subjectLabel"] = table#2441 { ["type"] = "literal", ["value"] = "Disjoint multipath closeness centrality", ["xml:lang"] = "en", }, }, table#2442 { ["itemType"] = table#2443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6106005", }, ["subjectLabel"] = table#2445 { ["type"] = "literal", ["value"] = "Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube", ["xml:lang"] = "en", }, }, table#2446 { ["itemType"] = table#2447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6107887", }, ["subjectLabel"] = table#2449 { ["type"] = "literal", ["value"] = "Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization", ["xml:lang"] = "en", }, }, table#2450 { ["itemType"] = table#2451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6110612", }, ["subjectLabel"] = table#2453 { ["type"] = "literal", ["value"] = "The statistical analysis for Sombor indices in a random polygonal chain networks", ["xml:lang"] = "en", }, }, table#2454 { ["itemType"] = table#2455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6110613", }, ["subjectLabel"] = table#2457 { ["type"] = "literal", ["value"] = "Digraphs whose \$m\$-step competition graphs are trees", ["xml:lang"] = "en", }, }, table#2458 { ["itemType"] = table#2459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6110622", }, ["subjectLabel"] = table#2461 { ["type"] = "literal", ["value"] = "Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs", ["xml:lang"] = "en", }, }, table#2462 { ["itemType"] = table#2463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6111630", }, ["subjectLabel"] = table#2465 { ["type"] = "literal", ["value"] = "Total coloring of planar graphs without some adjacent cycles", ["xml:lang"] = "en", }, }, table#2466 { ["itemType"] = table#2467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6113168", }, ["subjectLabel"] = table#2469 { ["type"] = "literal", ["value"] = "Zero-divisor graphs of rings and their Hermitian matrices", ["xml:lang"] = "en", }, }, table#2470 { ["itemType"] = table#2471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6115138", }, ["subjectLabel"] = table#2473 { ["type"] = "literal", ["value"] = "A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS", ["xml:lang"] = "en", }, }, table#2474 { ["itemType"] = table#2475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6115877", }, ["subjectLabel"] = table#2477 { ["type"] = "literal", ["value"] = "Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian", ["xml:lang"] = "en", }, }, table#2478 { ["itemType"] = table#2479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6116405", }, ["subjectLabel"] = table#2481 { ["type"] = "literal", ["value"] = "On the chromatic edge stability index of graphs", ["xml:lang"] = "en", }, }, table#2482 { ["itemType"] = table#2483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6117322", }, ["subjectLabel"] = table#2485 { ["type"] = "literal", ["value"] = "On list \$(p, 1)\$-total labellings of special planar graphs and 1-planar graphs", ["xml:lang"] = "en", }, }, table#2486 { ["itemType"] = table#2487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6118229", }, ["subjectLabel"] = table#2489 { ["type"] = "literal", ["value"] = "Graph reliability evaluation via random K -out-of- N systems", ["xml:lang"] = "en", }, }, table#2490 { ["itemType"] = table#2491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6120052", }, ["subjectLabel"] = table#2493 { ["type"] = "literal", ["value"] = "Factorization of covariant Feynman graphs for the effective action", ["xml:lang"] = "en", }, }, table#2494 { ["itemType"] = table#2495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6121343", }, ["subjectLabel"] = table#2497 { ["type"] = "literal", ["value"] = "Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree", ["xml:lang"] = "en", }, }, table#2498 { ["itemType"] = table#2499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6122218", }, ["subjectLabel"] = table#2501 { ["type"] = "literal", ["value"] = "An approximation algorithm for 3-Colourability", ["xml:lang"] = "en", }, }, table#2502 { ["itemType"] = table#2503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6122236", }, ["subjectLabel"] = table#2505 { ["type"] = "literal", ["value"] = "Diametral path graphs", ["xml:lang"] = "en", }, }, table#2506 { ["itemType"] = table#2507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6122411", }, ["subjectLabel"] = table#2509 { ["type"] = "literal", ["value"] = "Achromatic arboricity on complete graphs", ["xml:lang"] = "en", }, }, table#2510 { ["itemType"] = table#2511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6124426", }, ["subjectLabel"] = table#2513 { ["type"] = "literal", ["value"] = "Listing the bonds of a graph in \$\\widetilde{O} (n)\$-delay", ["xml:lang"] = "en", }, }, table#2514 { ["itemType"] = table#2515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6125428", }, ["subjectLabel"] = table#2517 { ["type"] = "literal", ["value"] = "Spectral bounds for the vulnerability parameters of graphs", ["xml:lang"] = "en", }, }, table#2518 { ["itemType"] = table#2519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6127130", }, ["subjectLabel"] = table#2521 { ["type"] = "literal", ["value"] = "An efficient feature selection algorithm based on the description vector and hypergraph", ["xml:lang"] = "en", }, }, table#2522 { ["itemType"] = table#2523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6132868", }, ["subjectLabel"] = table#2525 { ["type"] = "literal", ["value"] = "2-Trees: Structural insights and the study of Hamiltonian paths", ["xml:lang"] = "en", }, }, table#2526 { ["itemType"] = table#2527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6133769", }, ["subjectLabel"] = table#2529 { ["type"] = "literal", ["value"] = "The signless p-Laplacian spectral radius of graphs with given matching number", ["xml:lang"] = "en", }, }, table#2530 { ["itemType"] = table#2531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6134395", }, ["subjectLabel"] = table#2533 { ["type"] = "literal", ["value"] = "Social balance - a signed detour distance analysis", ["xml:lang"] = "en", }, }, table#2534 { ["itemType"] = table#2535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6136669", }, ["subjectLabel"] = table#2537 { ["type"] = "literal", ["value"] = "Ramsey-Turán type results for matchings in edge colored graphs", ["xml:lang"] = "en", }, }, table#2538 { ["itemType"] = table#2539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6137691", }, ["subjectLabel"] = table#2541 { ["type"] = "literal", ["value"] = "Every graph is local antimagic total and its applications", ["xml:lang"] = "en", }, }, table#2542 { ["itemType"] = table#2543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6140253", }, ["subjectLabel"] = table#2545 { ["type"] = "literal", ["value"] = "On \$(2, k)\$-Hamilton-connected graphs", ["xml:lang"] = "en", }, }, table#2546 { ["itemType"] = table#2547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6140323", }, ["subjectLabel"] = table#2549 { ["type"] = "literal", ["value"] = "The spectra of graphs based on general graph operations", ["xml:lang"] = "en", }, }, table#2550 { ["itemType"] = table#2551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6142825", }, ["subjectLabel"] = table#2553 { ["type"] = "literal", ["value"] = "Dead ends on wreath products and lamplighter groups", ["xml:lang"] = "en", }, }, table#2554 { ["itemType"] = table#2555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6143697", }, ["subjectLabel"] = table#2557 { ["type"] = "literal", ["value"] = "Maximal matching cover pebbling number for variants of hypercube", ["xml:lang"] = "en", }, }, table#2558 { ["itemType"] = table#2559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6143975", }, ["subjectLabel"] = table#2561 { ["type"] = "literal", ["value"] = "Deciding 3-colourability in less than O(1.415n) steps", ["xml:lang"] = "en", }, }, table#2562 { ["itemType"] = table#2563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6144449", }, ["subjectLabel"] = table#2565 { ["type"] = "literal", ["value"] = "Grassmannians of codes", ["xml:lang"] = "en", }, }, table#2566 { ["itemType"] = table#2567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6145814", }, ["subjectLabel"] = table#2569 { ["type"] = "literal", ["value"] = "Anti-Ramsey number of matchings in outerplanar graphs", ["xml:lang"] = "en", }, }, table#2570 { ["itemType"] = table#2571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6146492", }, ["subjectLabel"] = table#2573 { ["type"] = "literal", ["value"] = "Burling graphs revisited. II: Structure", ["xml:lang"] = "en", }, }, table#2574 { ["itemType"] = table#2575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6147864", }, ["subjectLabel"] = table#2577 { ["type"] = "literal", ["value"] = "An existence criterion for a cycle such that the vertices not included in it are independent", ["xml:lang"] = "en", }, }, table#2578 { ["itemType"] = table#2579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6151011", }, ["subjectLabel"] = table#2581 { ["type"] = "literal", ["value"] = "The non-inclusive diagnosability of regular graphs", ["xml:lang"] = "en", }, }, table#2582 { ["itemType"] = table#2583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6153478", }, ["subjectLabel"] = table#2585 { ["type"] = "literal", ["value"] = "Relations of three classes of disconnected coloring", ["xml:lang"] = "en", }, }, table#2586 { ["itemType"] = table#2587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6154428", }, ["subjectLabel"] = table#2589 { ["type"] = "literal", ["value"] = "On edge-transitive metacyclic covers of cubic arc-transitive graphs of order twice a prime", ["xml:lang"] = "en", }, }, table#2590 { ["itemType"] = table#2591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6155527", }, ["subjectLabel"] = table#2593 { ["type"] = "literal", ["value"] = "Topological representations of simplicial complexes and their applications", ["xml:lang"] = "en", }, }, table#2594 { ["itemType"] = table#2595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6155782", }, ["subjectLabel"] = table#2597 { ["type"] = "literal", ["value"] = "On local antimagic total labeling of complete graphs amalgamation", ["xml:lang"] = "en", }, }, table#2598 { ["itemType"] = table#2599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6158028", }, ["subjectLabel"] = table#2601 { ["type"] = "literal", ["value"] = "On multiplicative sum Zagreb index of trees with fixed domination number", ["xml:lang"] = "en", }, }, table#2602 { ["itemType"] = table#2603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6158906", }, ["subjectLabel"] = table#2605 { ["type"] = "literal", ["value"] = "A classification of connected cubic vertex-transitive bi-Cayley graphs over semidihedral group", ["xml:lang"] = "en", }, }, table#2606 { ["itemType"] = table#2607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6162025", }, ["subjectLabel"] = table#2609 { ["type"] = "literal", ["value"] = "An old problem of Erdős: a graph without two cycles of the same length", ["xml:lang"] = "en", }, }, table#2610 { ["itemType"] = table#2611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6162044", }, ["subjectLabel"] = table#2613 { ["type"] = "literal", ["value"] = "Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23", ["xml:lang"] = "en", }, }, table#2614 { ["itemType"] = table#2615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6164333", }, ["subjectLabel"] = table#2617 { ["type"] = "literal", ["value"] = "Honeycomb Hubbard model at van Hove filling", ["xml:lang"] = "en", }, }, table#2618 { ["itemType"] = table#2619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6164911", }, ["subjectLabel"] = table#2621 { ["type"] = "literal", ["value"] = "Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs", ["xml:lang"] = "en", }, }, table#2622 { ["itemType"] = table#2623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6166234", }, ["subjectLabel"] = table#2625 { ["type"] = "literal", ["value"] = "On balanced cycle domination of graphs", ["xml:lang"] = "en", }, }, table#2626 { ["itemType"] = table#2627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6166491", }, ["subjectLabel"] = table#2629 { ["type"] = "literal", ["value"] = "On the 4-flow nullity of graphs", ["xml:lang"] = "en", }, }, table#2630 { ["itemType"] = table#2631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6166500", }, ["subjectLabel"] = table#2633 { ["type"] = "literal", ["value"] = "Graphs with at most Four Seidel Eigenvalues", ["xml:lang"] = "en", }, }, table#2634 { ["itemType"] = table#2635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6167974", }, ["subjectLabel"] = table#2637 { ["type"] = "literal", ["value"] = "Degree polynomial for vertices in a graph and its behavior under graph operations", ["xml:lang"] = "en", }, }, table#2638 { ["itemType"] = table#2639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6169130", }, ["subjectLabel"] = table#2641 { ["type"] = "literal", ["value"] = "Resolution of the Erdős–Sauer problem on regular subgraphs", ["xml:lang"] = "en", }, }, table#2642 { ["itemType"] = table#2643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6169904", }, ["subjectLabel"] = table#2645 { ["type"] = "literal", ["value"] = "The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph", ["xml:lang"] = "en", }, }, table#2646 { ["itemType"] = table#2647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6169935", }, ["subjectLabel"] = table#2649 { ["type"] = "literal", ["value"] = "Isolated Rupture in Thorny Networks", ["xml:lang"] = "en", }, }, table#2650 { ["itemType"] = table#2651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6170323", }, ["subjectLabel"] = table#2653 { ["type"] = "literal", ["value"] = "MATHEMATICAL MODELLING AND SIMULATION OF FINGERPRINT ANALYSIS USING GRAPH ISOMORPHISM, DOMINATION, AND GRAPH PEBBLING", ["xml:lang"] = "en", }, }, table#2654 { ["itemType"] = table#2655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6171261", }, ["subjectLabel"] = table#2657 { ["type"] = "literal", ["value"] = "On Gupta’s Codensity Conjecture", ["xml:lang"] = "en", }, }, table#2658 { ["itemType"] = table#2659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6172297", }, ["subjectLabel"] = table#2661 { ["type"] = "literal", ["value"] = "A classification of tetravalent connected vertex-transitive bi-dicirculants", ["xml:lang"] = "en", }, }, table#2662 { ["itemType"] = table#2663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6173715", }, ["subjectLabel"] = table#2665 { ["type"] = "literal", ["value"] = "Prime coprime graph of a finite group", ["xml:lang"] = "en", }, }, table#2666 { ["itemType"] = table#2667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6173900", }, ["subjectLabel"] = table#2669 { ["type"] = "literal", ["value"] = "Cubic vertex-transitive graphs admitting automorphisms of large order", ["xml:lang"] = "en", }, }, table#2670 { ["itemType"] = table#2671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6174160", }, ["subjectLabel"] = table#2673 { ["type"] = "literal", ["value"] = "On fourth leap Zagreb index of graphs", ["xml:lang"] = "en", }, }, table#2674 { ["itemType"] = table#2675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6174162", }, ["subjectLabel"] = table#2677 { ["type"] = "literal", ["value"] = "Approaches that output infinitely many graphs with small local antimagic chromatic number", ["xml:lang"] = "en", }, }, table#2678 { ["itemType"] = table#2679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6174165", }, ["subjectLabel"] = table#2681 { ["type"] = "literal", ["value"] = "Algorithmic aspects of domination number in nano topology induced by graph", ["xml:lang"] = "en", }, }, table#2682 { ["itemType"] = table#2683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6180568", }, ["subjectLabel"] = table#2685 { ["type"] = "literal", ["value"] = "Counting spanning trees of \$(1, N\$)-periodic graphs", ["xml:lang"] = "en", }, }, table#2686 { ["itemType"] = table#2687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6180579", }, ["subjectLabel"] = table#2689 { ["type"] = "literal", ["value"] = "The greatest values for atom-bond sum-connectivity index of graphs with given parameters", ["xml:lang"] = "en", }, }, table#2690 { ["itemType"] = table#2691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6181220", }, ["subjectLabel"] = table#2693 { ["type"] = "literal", ["value"] = "Reducible 3-critical graphs", ["xml:lang"] = "en", }, }, table#2694 { ["itemType"] = table#2695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6183431", }, ["subjectLabel"] = table#2697 { ["type"] = "literal", ["value"] = "Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs", ["xml:lang"] = "en", }, }, table#2698 { ["itemType"] = table#2699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6184086", }, ["subjectLabel"] = table#2701 { ["type"] = "literal", ["value"] = "Algorithms in direct decompositions of torsion-free abelian groups", ["xml:lang"] = "en", }, }, table#2702 { ["itemType"] = table#2703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6184372", }, ["subjectLabel"] = table#2705 { ["type"] = "literal", ["value"] = "The maximal f-dependent set problem for planar graphs is in NC", ["xml:lang"] = "en", }, }, table#2706 { ["itemType"] = table#2707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6184378", }, ["subjectLabel"] = table#2709 { ["type"] = "literal", ["value"] = "Rankings of graphs", ["xml:lang"] = "en", }, }, table#2710 { ["itemType"] = table#2711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6186412", }, ["subjectLabel"] = table#2713 { ["type"] = "literal", ["value"] = "On unitary/strong linear realizations: Buratti-Horak-Rosa conjecture", ["xml:lang"] = "en", }, }, table#2714 { ["itemType"] = table#2715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6187739", }, ["subjectLabel"] = table#2717 { ["type"] = "literal", ["value"] = "Common Fixed Points Via R-Functions and Digraphs with an Application to Homotopy Theory", ["xml:lang"] = "en", }, }, table#2718 { ["itemType"] = table#2719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6189483", }, ["subjectLabel"] = table#2721 { ["type"] = "literal", ["value"] = "An ideal-based cozero-divisor graph of a commutative ring", ["xml:lang"] = "en", }, }, table#2722 { ["itemType"] = table#2723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6191153", }, ["subjectLabel"] = table#2725 { ["type"] = "literal", ["value"] = "A clustering- and maximum consensus-based model for social network large-scale group decision making with linguistic distribution", ["xml:lang"] = "en", }, }, table#2726 { ["itemType"] = table#2727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6193227", }, ["subjectLabel"] = table#2729 { ["type"] = "literal", ["value"] = "Bipartite leaderless synchronization of fractional-order coupled neural networks via edge-based adaptive pinning control", ["xml:lang"] = "en", }, }, table#2730 { ["itemType"] = table#2731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6193840", }, ["subjectLabel"] = table#2733 { ["type"] = "literal", ["value"] = "A Short Proof of Ore’s f-Factor Theorem Using Flows", ["xml:lang"] = "en", }, }, table#2734 { ["itemType"] = table#2735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6196455", }, ["subjectLabel"] = table#2737 { ["type"] = "literal", ["value"] = "Managing consensus based on community classification in opinion dynamics", ["xml:lang"] = "en", }, }, table#2738 { ["itemType"] = table#2739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6199792", }, ["subjectLabel"] = table#2741 { ["type"] = "literal", ["value"] = "Multidimensional Friedkin-Johnsen model with increasing stubbornness in social networks", ["xml:lang"] = "en", }, }, table#2742 { ["itemType"] = table#2743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6200861", }, ["subjectLabel"] = table#2745 { ["type"] = "literal", ["value"] = "Bounding the \$A_\\alpha\$-spectral radius of \$k\$-connected irregular graphs", ["xml:lang"] = "en", }, }, table#2746 { ["itemType"] = table#2747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6203914", }, ["subjectLabel"] = table#2749 { ["type"] = "literal", ["value"] = "Solving the Mostar index inverse problem", ["xml:lang"] = "en", }, }, table#2750 { ["itemType"] = table#2751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6204352", }, ["subjectLabel"] = table#2753 { ["type"] = "literal", ["value"] = "The complete value of the Turán number of \$3K_{p+1}\$", ["xml:lang"] = "en", }, }, table#2754 { ["itemType"] = table#2755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6126505", }, ["subjectLabel"] = table#2757 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6126505", }, }, table#2758 { ["itemType"] = table#2759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6144232", }, ["subjectLabel"] = table#2761 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6144232", }, }, table#2762 { ["itemType"] = table#2763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6145871", }, ["subjectLabel"] = table#2765 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6145871", }, }, table#2766 { ["itemType"] = table#2767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6150927", }, ["subjectLabel"] = table#2769 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6150927", }, }, table#2770 { ["itemType"] = table#2771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6167745", }, ["subjectLabel"] = table#2773 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6167745", }, }, table#2774 { ["itemType"] = table#2775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6198983", }, ["subjectLabel"] = table#2777 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6198983", }, }, table#2778 { ["itemType"] = table#2779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3960725", }, ["subjectLabel"] = table#2781 { ["type"] = "literal", ["value"] = "Decomposition of Directed Graphs", ["xml:lang"] = "en", }, }, table#2782 { ["itemType"] = table#2783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3960741", }, ["subjectLabel"] = table#2785 { ["type"] = "literal", ["value"] = "On the berge—sauer conjecture", ["xml:lang"] = "en", }, }, table#2786 { ["itemType"] = table#2787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3963032", }, ["subjectLabel"] = table#2789 { ["type"] = "literal", ["value"] = "Arc‐disjoint arborescences of digraphs", ["xml:lang"] = "en", }, }, table#2790 { ["itemType"] = table#2791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3964591", }, ["subjectLabel"] = table#2793 { ["type"] = "literal", ["value"] = "Farey Series and Maximal Outerplanar Graphs", ["xml:lang"] = "en", }, }, table#2794 { ["itemType"] = table#2795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3964607", }, ["subjectLabel"] = table#2797 { ["type"] = "literal", ["value"] = "Switchings Constrained to 2-Connectivity in Simple Graphs", ["xml:lang"] = "en", }, }, table#2798 { ["itemType"] = table#2799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3970899", }, ["subjectLabel"] = table#2801 { ["type"] = "literal", ["value"] = "Trees and unicyclic graphs with hamiltonian path graphs", ["xml:lang"] = "en", }, }, table#2802 { ["itemType"] = table#2803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3970908", }, ["subjectLabel"] = table#2805 { ["type"] = "literal", ["value"] = "Linear arboricity of random regular graphs", ["xml:lang"] = "en", }, }, table#2806 { ["itemType"] = table#2807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3971221", }, ["subjectLabel"] = table#2809 { ["type"] = "literal", ["value"] = "On the multiway cut polyhedron", ["xml:lang"] = "en", }, }, table#2810 { ["itemType"] = table#2811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4539868", }, ["subjectLabel"] = table#2813 { ["type"] = "literal", ["value"] = "Combinatorial curvature for planar graphs", ["xml:lang"] = "en", }, }, table#2814 { ["itemType"] = table#2815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4539874", }, ["subjectLabel"] = table#2817 { ["type"] = "literal", ["value"] = "Forbidden subgraphs that imply hamiltonian‐connectedness*", ["xml:lang"] = "en", }, }, table#2818 { ["itemType"] = table#2819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3978362", }, ["subjectLabel"] = table#2821 { ["type"] = "literal", ["value"] = "Updating the hamiltonian problem—A survey", ["xml:lang"] = "en", }, }, table#2822 { ["itemType"] = table#2823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3978365", }, ["subjectLabel"] = table#2825 { ["type"] = "literal", ["value"] = "Seven criteria for integer sequences being graphic", ["xml:lang"] = "en", }, }, table#2826 { ["itemType"] = table#2827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3978368", }, ["subjectLabel"] = table#2829 { ["type"] = "literal", ["value"] = "Regular factors in K_1,3‐free graphs", ["xml:lang"] = "en", }, }, table#2830 { ["itemType"] = table#2831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4271616", }, ["subjectLabel"] = table#2833 { ["type"] = "literal", ["value"] = "Collapsible graphs and matchings", ["xml:lang"] = "en", }, }, table#2834 { ["itemType"] = table#2835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4271618", }, ["subjectLabel"] = table#2837 { ["type"] = "literal", ["value"] = "Generating all 3‐connected 4‐regular planar graphs from the octahedron graph", ["xml:lang"] = "en", }, }, table#2838 { ["itemType"] = table#2839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4271622", }, ["subjectLabel"] = table#2841 { ["type"] = "literal", ["value"] = "On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs", ["xml:lang"] = "en", }, }, table#2842 { ["itemType"] = table#2843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4277987", }, ["subjectLabel"] = table#2845 { ["type"] = "literal", ["value"] = "On even circuit decompositions of eulerian graphs", ["xml:lang"] = "en", }, }, table#2846 { ["itemType"] = table#2847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4277991", }, ["subjectLabel"] = table#2849 { ["type"] = "literal", ["value"] = "On the toughness index of planar graphs", ["xml:lang"] = "en", }, }, table#2850 { ["itemType"] = table#2851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3993632", }, ["subjectLabel"] = table#2853 { ["type"] = "literal", ["value"] = "Complexity results for well‐covered graphs", ["xml:lang"] = "en", }, }, table#2854 { ["itemType"] = table#2855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3993634", }, ["subjectLabel"] = table#2857 { ["type"] = "literal", ["value"] = "On a parametric shortest path problem from primal—dual multicommodity network optimization", ["xml:lang"] = "en", }, }, table#2858 { ["itemType"] = table#2859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4284101", }, ["subjectLabel"] = table#2861 { ["type"] = "literal", ["value"] = "Smallest (1, 2)‐eulerian weight and shortest cycle covering", ["xml:lang"] = "en", }, }, table#2862 { ["itemType"] = table#2863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4285588", }, ["subjectLabel"] = table#2865 { ["type"] = "literal", ["value"] = "Disjoint Hamiltonian cycles in fan 2k‐type graphs", ["xml:lang"] = "en", }, }, table#2866 { ["itemType"] = table#2867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4285591", }, ["subjectLabel"] = table#2869 { ["type"] = "literal", ["value"] = "Sufficient conditions for equality of connectivity and minimum degree of a graph", ["xml:lang"] = "en", }, }, table#2870 { ["itemType"] = table#2871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4288043", }, ["subjectLabel"] = table#2873 { ["type"] = "literal", ["value"] = "A COHESION INDEX FOR COOPERATION GRAPHS", ["xml:lang"] = "en", }, }, table#2874 { ["itemType"] = table#2875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4289304", }, ["subjectLabel"] = table#2877 { ["type"] = "literal", ["value"] = "Hamilton Cycles in Oriented Graphs", ["xml:lang"] = "en", }, }, table#2878 { ["itemType"] = table#2879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4290576", }, ["subjectLabel"] = table#2881 { ["type"] = "literal", ["value"] = "Edge‐maximal (k, i)‐graphs", ["xml:lang"] = "en", }, }, table#2882 { ["itemType"] = table#2883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4291482", }, ["subjectLabel"] = table#2885 { ["type"] = "literal", ["value"] = "A new characterization of tree medians with applications to distributed sorting", ["xml:lang"] = "en", }, }, table#2886 { ["itemType"] = table#2887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4291490", }, ["subjectLabel"] = table#2889 { ["type"] = "literal", ["value"] = "Mengerian properties, hamiltonicity, and claw‐free graphs", ["xml:lang"] = "en", }, }, table#2890 { ["itemType"] = table#2891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013414", }, ["subjectLabel"] = table#2893 { ["type"] = "literal", ["value"] = "Hamiltonian graphs involving distances", ["xml:lang"] = "en", }, }, table#2894 { ["itemType"] = table#2895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013416", }, ["subjectLabel"] = table#2897 { ["type"] = "literal", ["value"] = "A degree condition for the existence ofk-factors", ["xml:lang"] = "en", }, }, table#2898 { ["itemType"] = table#2899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013418", }, ["subjectLabel"] = table#2901 { ["type"] = "literal", ["value"] = "The chromatic index of complete multipartite graphs", ["xml:lang"] = "en", }, }, table#2902 { ["itemType"] = table#2903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013420", }, ["subjectLabel"] = table#2905 { ["type"] = "literal", ["value"] = "Supereulerian graphs: A survey", ["xml:lang"] = "en", }, }, table#2906 { ["itemType"] = table#2907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013430", }, ["subjectLabel"] = table#2909 { ["type"] = "literal", ["value"] = "2‐neighborhoods and hamiltonian conditions", ["xml:lang"] = "en", }, }, table#2910 { ["itemType"] = table#2911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4014273", }, ["subjectLabel"] = table#2913 { ["type"] = "literal", ["value"] = "Vertex 2-isomorphism", ["xml:lang"] = "en", }, }, table#2914 { ["itemType"] = table#2915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4303628", }, ["subjectLabel"] = table#2917 { ["type"] = "literal", ["value"] = "Spanners in graphs of bounded degree", ["xml:lang"] = "en", }, }, table#2918 { ["itemType"] = table#2919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304251", }, ["subjectLabel"] = table#2921 { ["type"] = "literal", ["value"] = "Pancyclic oriented graphs", ["xml:lang"] = "en", }, }, table#2922 { ["itemType"] = table#2923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304255", }, ["subjectLabel"] = table#2925 { ["type"] = "literal", ["value"] = "Hamiltonian graphs with neighborhood intersections", ["xml:lang"] = "en", }, }, table#2926 { ["itemType"] = table#2927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4305120", }, ["subjectLabel"] = table#2929 { ["type"] = "literal", ["value"] = "A bad submatrix is easy to find", ["xml:lang"] = "en", }, }, table#2930 { ["itemType"] = table#2931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4305122", }, ["subjectLabel"] = table#2933 { ["type"] = "literal", ["value"] = "A proof of Boesch's conjecture", ["xml:lang"] = "en", }, }, table#2934 { ["itemType"] = table#2935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4306427", }, ["subjectLabel"] = table#2937 { ["type"] = "literal", ["value"] = "Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs", ["xml:lang"] = "en", }, }, table#2938 { ["itemType"] = table#2939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4020699", }, ["subjectLabel"] = table#2941 { ["type"] = "literal", ["value"] = "Orientation embedding of signed graphs", ["xml:lang"] = "en", }, }, table#2942 { ["itemType"] = table#2943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4022730", }, ["subjectLabel"] = table#2945 { ["type"] = "literal", ["value"] = "Countingk-component forests of a graph", ["xml:lang"] = "en", }, }, table#2946 { ["itemType"] = table#2947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4313626", }, ["subjectLabel"] = table#2949 { ["type"] = "literal", ["value"] = "New results for the degree/diameter problem", ["xml:lang"] = "en", }, }, table#2950 { ["itemType"] = table#2951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4314150", }, ["subjectLabel"] = table#2953 { ["type"] = "literal", ["value"] = "On Universal Threshold Graphs", ["xml:lang"] = "en", }, }, table#2954 { ["itemType"] = table#2955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4317220", }, ["subjectLabel"] = table#2957 { ["type"] = "literal", ["value"] = "Nonseparable graphs with a given number of cycles", ["xml:lang"] = "en", }, }, table#2958 { ["itemType"] = table#2959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4317221", }, ["subjectLabel"] = table#2961 { ["type"] = "literal", ["value"] = "A chvátal–erdős type condition for hamiltonian graphs", ["xml:lang"] = "en", }, }, table#2962 { ["itemType"] = table#2963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4320467", }, ["subjectLabel"] = table#2965 { ["type"] = "literal", ["value"] = "A class of planar well‐covered graphs with girth four", ["xml:lang"] = "en", }, }, table#2966 { ["itemType"] = table#2967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4320469", }, ["subjectLabel"] = table#2969 { ["type"] = "literal", ["value"] = "Factorization of regular multigraphs into regular graphs", ["xml:lang"] = "en", }, }, table#2970 { ["itemType"] = table#2971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4322545", }, ["subjectLabel"] = table#2973 { ["type"] = "literal", ["value"] = "A reversal index for tournament matrices^*", ["xml:lang"] = "en", }, }, table#2974 { ["itemType"] = table#2975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4326537", }, ["subjectLabel"] = table#2977 { ["type"] = "literal", ["value"] = "Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1", ["xml:lang"] = "en", }, }, table#2978 { ["itemType"] = table#2979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4336771", }, ["subjectLabel"] = table#2981 { ["type"] = "literal", ["value"] = "Some eigenvalue inequalities for matrices with restricted entries", ["xml:lang"] = "en", }, }, table#2982 { ["itemType"] = table#2983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4354110", }, ["subjectLabel"] = table#2985 { ["type"] = "literal", ["value"] = "Lowersemicontinuity of energy clusters", ["xml:lang"] = "en", }, }, table#2986 { ["itemType"] = table#2987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4220446", }, ["subjectLabel"] = table#2989 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4220446", }, }, table#2990 { ["itemType"] = table#2991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4502805", }, ["subjectLabel"] = table#2993 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4502805", }, }, table#2994 { ["itemType"] = table#2995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4365006", }, ["subjectLabel"] = table#2997 { ["type"] = "literal", ["value"] = "Multidimensional linear congruential graphs", ["xml:lang"] = "en", }, }, table#2998 { ["itemType"] = table#2999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4373405", }, ["subjectLabel"] = table#3001 { ["type"] = "literal", ["value"] = "The complete spectrum of 6‐cycle systems of l(k_n)", ["xml:lang"] = "en", }, }, table#3002 { ["itemType"] = table#3003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4375407", }, ["subjectLabel"] = table#3005 { ["type"] = "literal", ["value"] = "A new algorithm for stable assignment", ["xml:lang"] = "en", }, }, table#3006 { ["itemType"] = table#3007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4242740", }, ["subjectLabel"] = table#3009 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4242740", }, }, table#3010 { ["itemType"] = table#3011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4378113", }, ["subjectLabel"] = table#3013 { ["type"] = "literal", ["value"] = "An algorithm for inverse minimum spanning tree problem", ["xml:lang"] = "en", }, }, table#3014 { ["itemType"] = table#3015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4487073", }, ["subjectLabel"] = table#3017 { ["type"] = "literal", ["value"] = "Closure and stable Hamiltonian properties in claw-free graphs", ["xml:lang"] = "en", }, }, table#3018 { ["itemType"] = table#3019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4487077", }, ["subjectLabel"] = table#3021 { ["type"] = "literal", ["value"] = "Half-transitive graphs of valency 4 with prescribed attachment numbers", ["xml:lang"] = "en", }, }, table#3022 { ["itemType"] = table#3023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4489490", }, ["subjectLabel"] = table#3025 { ["type"] = "literal", ["value"] = "Digraphs containing every possible pair of dicycles", ["xml:lang"] = "en", }, }, table#3026 { ["itemType"] = table#3027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4500706", }, ["subjectLabel"] = table#3029 { ["type"] = "literal", ["value"] = "Cyclability of 3-connected graphs", ["xml:lang"] = "en", }, }, table#3030 { ["itemType"] = table#3031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4262222", }, ["subjectLabel"] = table#3033 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4262222", }, }, table#3034 { ["itemType"] = table#3035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4506268", }, ["subjectLabel"] = table#3037 { ["type"] = "literal", ["value"] = "Orthogonal (g, f)-factorizations in networks", ["xml:lang"] = "en", }, }, table#3038 { ["itemType"] = table#3039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4508618", }, ["subjectLabel"] = table#3041 { ["type"] = "literal", ["value"] = "Edge disjoint Hamilton cycles in graphs", ["xml:lang"] = "en", }, }, table#3042 { ["itemType"] = table#3043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4553293", }, ["subjectLabel"] = table#3045 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4553293", }, }, table#3046 { ["itemType"] = table#3047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4238042", }, ["subjectLabel"] = table#3049 { ["type"] = "literal", ["value"] = "Extending a partial nowhere-zero 4-flow", ["xml:lang"] = "en", }, }, table#3050 { ["itemType"] = table#3051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4277394", }, ["subjectLabel"] = table#3053 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4277394", }, }, table#3054 { ["itemType"] = table#3055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4521490", }, ["subjectLabel"] = table#3057 { ["type"] = "literal", ["value"] = "Crossing properties of graph reliability functions", ["xml:lang"] = "en", }, }, table#3058 { ["itemType"] = table#3059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4018927", }, ["subjectLabel"] = table#3061 { ["type"] = "literal", ["value"] = "Quasidiagonality of Direct Sums of Weighted Shifts", ["xml:lang"] = "en", }, }, table#3062 { ["itemType"] = table#3063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4018926", }, ["subjectLabel"] = table#3065 { ["type"] = "literal", ["value"] = "Expansions of Chromatic Polynomials and Log-Concavity", ["xml:lang"] = "en", }, }, table#3066 { ["itemType"] = table#3067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4248534", }, ["subjectLabel"] = table#3069 { ["type"] = "literal", ["value"] = "On 2-factors of a bipartite graph", ["xml:lang"] = "en", }, }, table#3070 { ["itemType"] = table#3071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4248537", }, ["subjectLabel"] = table#3073 { ["type"] = "literal", ["value"] = "P4-decompositions of regular graphs", ["xml:lang"] = "en", }, }, table#3074 { ["itemType"] = table#3075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4422648", }, ["subjectLabel"] = table#3077 { ["type"] = "literal", ["value"] = "Odyssey: a high-performance clustered video server", ["xml:lang"] = "en", }, }, table#3078 { ["itemType"] = table#3079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4429233", }, ["subjectLabel"] = table#3081 { ["type"] = "literal", ["value"] = "The Basis Number of Some Special Non-Planar Graphs", ["xml:lang"] = "en", }, }, table#3082 { ["itemType"] = table#3083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4254359", }, ["subjectLabel"] = table#3085 { ["type"] = "literal", ["value"] = "Various results on the toughness of graphs", ["xml:lang"] = "en", }, }, table#3086 { ["itemType"] = table#3087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4254351", }, ["subjectLabel"] = table#3089 { ["type"] = "literal", ["value"] = "Transmissions in a network with capacities and delays", ["xml:lang"] = "en", }, }, table#3090 { ["itemType"] = table#3091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4256106", }, ["subjectLabel"] = table#3093 { ["type"] = "literal", ["value"] = "On removable circuits in graphs and matroids", ["xml:lang"] = "en", }, }, table#3094 { ["itemType"] = table#3095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4261182", }, ["subjectLabel"] = table#3097 { ["type"] = "literal", ["value"] = "The edge chromatic number of a directed/mixed multigraph", ["xml:lang"] = "en", }, }, table#3098 { ["itemType"] = table#3099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4446888", }, ["subjectLabel"] = table#3101 { ["type"] = "literal", ["value"] = "How many disjoint 2-edge paths must a cubic graph have?", ["xml:lang"] = "en", }, }, table#3102 { ["itemType"] = table#3103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013075", }, ["subjectLabel"] = table#3105 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4013075", }, }, table#3106 { ["itemType"] = table#3107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4193480", }, ["subjectLabel"] = table#3109 { ["type"] = "literal", ["value"] = "-constructibility of planar graphs", ["xml:lang"] = "en", }, }, table#3110 { ["itemType"] = table#3111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4192088", }, ["subjectLabel"] = table#3113 { ["type"] = "literal", ["value"] = "A bibliographic survey of edge‐colorings", ["xml:lang"] = "en", }, }, table#3114 { ["itemType"] = table#3115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4459608", }, ["subjectLabel"] = table#3117 { ["type"] = "literal", ["value"] = "Spanning 2‐trails from degree sum conditions", ["xml:lang"] = "en", }, }, table#3118 { ["itemType"] = table#3119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4464271", }, ["subjectLabel"] = table#3121 { ["type"] = "literal", ["value"] = "A characterization of spectral integral variation in two places for Laplacian matrices", ["xml:lang"] = "en", }, }, table#3122 { ["itemType"] = table#3123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4201386", }, ["subjectLabel"] = table#3125 { ["type"] = "literal", ["value"] = "Hamiltonian cycles in 3‐connected claw‐free graphs", ["xml:lang"] = "en", }, }, table#3126 { ["itemType"] = table#3127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4201393", }, ["subjectLabel"] = table#3129 { ["type"] = "literal", ["value"] = "Cycles containing all vertices of maximum degree", ["xml:lang"] = "en", }, }, table#3130 { ["itemType"] = table#3131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4474292", }, ["subjectLabel"] = table#3133 { ["type"] = "literal", ["value"] = "Low-connectivity network design on series-parallel graphs", ["xml:lang"] = "en", }, }, table#3134 { ["itemType"] = table#3135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4474303", }, ["subjectLabel"] = table#3137 { ["type"] = "literal", ["value"] = "The maximum-leaf spanning tree problem: Formulations and facets", ["xml:lang"] = "en", }, }, table#3138 { ["itemType"] = table#3139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4206762", }, ["subjectLabel"] = table#3141 { ["type"] = "literal", ["value"] = "On longest cycles and strongly linking vertex sets", ["xml:lang"] = "en", }, }, table#3142 { ["itemType"] = table#3143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4206764", }, ["subjectLabel"] = table#3145 { ["type"] = "literal", ["value"] = "Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen", ["xml:lang"] = "en", }, }, table#3146 { ["itemType"] = table#3147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4230175", }, ["subjectLabel"] = table#3149 { ["type"] = "literal", ["value"] = "Models for machine-part grouping in cellular manufacturing", ["xml:lang"] = "en", }, }, table#3150 { ["itemType"] = table#3151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4230254", }, ["subjectLabel"] = table#3153 { ["type"] = "literal", ["value"] = "A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices", ["xml:lang"] = "en", }, }, table#3154 { ["itemType"] = table#3155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3944622", }, ["subjectLabel"] = table#3157 { ["type"] = "literal", ["value"] = "On Crapo's Beta Invariant for Matroids", ["xml:lang"] = "en", }, }, table#3158 { ["itemType"] = table#3159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3949073", }, ["subjectLabel"] = table#3161 { ["type"] = "literal", ["value"] = "Generalizations of planar graphs", ["xml:lang"] = "en", }, }, table#3162 { ["itemType"] = table#3163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3949078", }, ["subjectLabel"] = table#3165 { ["type"] = "literal", ["value"] = "Cages—a survey", ["xml:lang"] = "en", }, }, table#3166 { ["itemType"] = table#3167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3953789", }, ["subjectLabel"] = table#3169 { ["type"] = "literal", ["value"] = "On digraphs without antidirected cycles", ["xml:lang"] = "en", }, }, table#3170 { ["itemType"] = table#3171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3955381", }, ["subjectLabel"] = table#3173 { ["type"] = "literal", ["value"] = "On maximum bipartite subgraphs", ["xml:lang"] = "en", }, }, table#3174 { ["itemType"] = table#3175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3956978", }, ["subjectLabel"] = table#3177 { ["type"] = "literal", ["value"] = "A counterexample to a conjecture on paths of bounded length", ["xml:lang"] = "en", }, }, table#3178 { ["itemType"] = table#3179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2887017", }, ["subjectLabel"] = table#3181 { ["type"] = "literal", ["value"] = "The diagnosability of thek-aryn-cubes using the pessimistic strategy", ["xml:lang"] = "en", }, }, table#3182 { ["itemType"] = table#3183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2890987", }, ["subjectLabel"] = table#3185 { ["type"] = "literal", ["value"] = "NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS", ["xml:lang"] = "en", }, }, table#3186 { ["itemType"] = table#3187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2890991", }, ["subjectLabel"] = table#3189 { ["type"] = "literal", ["value"] = "CYCLES IN TRIANGLE-FREE GRAPHS", ["xml:lang"] = "en", }, }, table#3190 { ["itemType"] = table#3191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2891038", }, ["subjectLabel"] = table#3193 { ["type"] = "literal", ["value"] = "Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs", ["xml:lang"] = "en", }, }, table#3194 { ["itemType"] = table#3195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2891039", }, ["subjectLabel"] = table#3197 { ["type"] = "literal", ["value"] = "Claw-free graphs and 2-factors that separate independent vertices", ["xml:lang"] = "en", }, }, table#3198 { ["itemType"] = table#3199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2891054", }, ["subjectLabel"] = table#3201 { ["type"] = "literal", ["value"] = "Group connectivity of complementary graphs", ["xml:lang"] = "en", }, }, table#3202 { ["itemType"] = table#3203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2894989", }, ["subjectLabel"] = table#3205 { ["type"] = "literal", ["value"] = "Exploitation of symmetry in graphs with applications to finite and boundary elements analysis", ["xml:lang"] = "en", }, }, table#3206 { ["itemType"] = table#3207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2702745", }, ["subjectLabel"] = table#3209 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2702745", }, }, table#3210 { ["itemType"] = table#3211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2905274", }, ["subjectLabel"] = table#3213 { ["type"] = "literal", ["value"] = "CYCLIC CONNECTIVITY OF STAR GRAPH", ["xml:lang"] = "en", }, }, table#3214 { ["itemType"] = table#3215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2905281", }, ["subjectLabel"] = table#3217 { ["type"] = "literal", ["value"] = "A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES", ["xml:lang"] = "en", }, }, table#3218 { ["itemType"] = table#3219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2905304", }, ["subjectLabel"] = table#3221 { ["type"] = "literal", ["value"] = "DIAMETER VULNERABILITY OF DIRECTED CYCLES AND DIRECTED TORI", ["xml:lang"] = "en", }, }, table#3222 { ["itemType"] = table#3223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2909178", }, ["subjectLabel"] = table#3225 { ["type"] = "literal", ["value"] = "ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS", ["xml:lang"] = "en", }, }, table#3226 { ["itemType"] = table#3227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2909503", }, ["subjectLabel"] = table#3229 { ["type"] = "literal", ["value"] = "GRAPHICAL CALCULI FOR THE DUBROVNIK POLYNOMIAL WITH APPLICATIONS", ["xml:lang"] = "en", }, }, table#3230 { ["itemType"] = table#3231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2911065", }, ["subjectLabel"] = table#3233 { ["type"] = "literal", ["value"] = "Binding Number, Minimum Degree, and Cycle Structure in Graphs", ["xml:lang"] = "en", }, }, table#3234 { ["itemType"] = table#3235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2913787", }, ["subjectLabel"] = table#3237 { ["type"] = "literal", ["value"] = "Path Problems in Complex Networks", ["xml:lang"] = "en", }, }, table#3238 { ["itemType"] = table#3239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2920884", }, ["subjectLabel"] = table#3241 { ["type"] = "literal", ["value"] = "The intersection graph of ideals of a poset", ["xml:lang"] = "en", }, }, table#3242 { ["itemType"] = table#3243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2920892", }, ["subjectLabel"] = table#3245 { ["type"] = "literal", ["value"] = "Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs", ["xml:lang"] = "en", }, }, table#3246 { ["itemType"] = table#3247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2922224", }, ["subjectLabel"] = table#3249 { ["type"] = "literal", ["value"] = "Cycle Double Covers in Cubic Graphs having Special Structures", ["xml:lang"] = "en", }, }, table#3250 { ["itemType"] = table#3251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2741481", }, ["subjectLabel"] = table#3253 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2741481", }, }, table#3254 { ["itemType"] = table#3255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2931911", }, ["subjectLabel"] = table#3257 { ["type"] = "literal", ["value"] = "$\\widetilde{S}_k$-Factorization of the symmetric digraph of wreath product of graphs", ["xml:lang"] = "en", }, }, table#3258 { ["itemType"] = table#3259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2935362", }, ["subjectLabel"] = table#3261 { ["type"] = "literal", ["value"] = "Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs", ["xml:lang"] = "en", }, }, table#3262 { ["itemType"] = table#3263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2935367", }, ["subjectLabel"] = table#3265 { ["type"] = "literal", ["value"] = "The packing number and Laplacian spectrum of a graph", ["xml:lang"] = "en", }, }, table#3266 { ["itemType"] = table#3267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2940992", }, ["subjectLabel"] = table#3269 { ["type"] = "literal", ["value"] = "Strong Circuit Double Cover of Some Cubic Graphs", ["xml:lang"] = "en", }, }, table#3270 { ["itemType"] = table#3271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2712590", }, ["subjectLabel"] = table#3273 { ["type"] = "literal", ["value"] = "On weights of induced paths and cycles in claw-free andK1,r-free graphs", ["xml:lang"] = "en", }, }, table#3274 { ["itemType"] = table#3275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2725320", }, ["subjectLabel"] = table#3277 { ["type"] = "literal", ["value"] = "On packing 3-vertex paths in a graph", ["xml:lang"] = "en", }, }, table#3278 { ["itemType"] = table#3279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2777533", }, ["subjectLabel"] = table#3281 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2777533", }, }, table#3282 { ["itemType"] = table#3283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2957754", }, ["subjectLabel"] = table#3285 { ["type"] = "literal", ["value"] = "Ordering connected graphs by their Kirchhoff indices", ["xml:lang"] = "en", }, }, table#3286 { ["itemType"] = table#3287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2682924", }, ["subjectLabel"] = table#3289 { ["type"] = "literal", ["value"] = "A generalization of properly colored paths and cycles in edge-colored graphs", ["xml:lang"] = "en", }, }, table#3290 { ["itemType"] = table#3291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2683164", }, ["subjectLabel"] = table#3293 { ["type"] = "literal", ["value"] = "The signless \$p\$-Laplacian spectral radius of graphs with given degree sequences", ["xml:lang"] = "en", }, }, table#3294 { ["itemType"] = table#3295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2684801", }, ["subjectLabel"] = table#3297 { ["type"] = "literal", ["value"] = "Comparison between Merrifield-Simmons index and Wiener index of graphs", ["xml:lang"] = "en", }, }, table#3298 { ["itemType"] = table#3299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2685284", }, ["subjectLabel"] = table#3301 { ["type"] = "literal", ["value"] = "Multicolor bipartite Ramsey numbers for paths, cycles, and stripes", ["xml:lang"] = "en", }, }, table#3302 { ["itemType"] = table#3303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2961481", }, ["subjectLabel"] = table#3305 { ["type"] = "literal", ["value"] = "On a conjecture for the signless Laplacian spectral radius of cacti with given matching number", ["xml:lang"] = "en", }, }, table#3306 { ["itemType"] = table#3307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2961569", }, ["subjectLabel"] = table#3309 { ["type"] = "literal", ["value"] = "Dynamic Reductions for Model Checking Concurrent Software", ["xml:lang"] = "en", }, }, table#3310 { ["itemType"] = table#3311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2689115", }, ["subjectLabel"] = table#3313 { ["type"] = "literal", ["value"] = "Turán problems for \$k\$-geodetic digraphs", ["xml:lang"] = "en", }, }, table#3314 { ["itemType"] = table#3315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2690609", }, ["subjectLabel"] = table#3317 { ["type"] = "literal", ["value"] = "Hamilton-connectivity of interconnection networks modeled by a product of graphs", ["xml:lang"] = "en", }, }, table#3318 { ["itemType"] = table#3319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2966514", }, ["subjectLabel"] = table#3321 { ["type"] = "literal", ["value"] = "On chromatic Zagreb indices of certain graphs", ["xml:lang"] = "en", }, }, table#3322 { ["itemType"] = table#3323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2696610", }, ["subjectLabel"] = table#3325 { ["type"] = "literal", ["value"] = "Relating the annihilation number and the total domination number for some graphs", ["xml:lang"] = "en", }, }, table#3326 { ["itemType"] = table#3327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2696897", }, ["subjectLabel"] = table#3329 { ["type"] = "literal", ["value"] = "Flow-oriented perturbation theory", ["xml:lang"] = "en", }, }, table#3330 { ["itemType"] = table#3331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2698203", }, ["subjectLabel"] = table#3333 { ["type"] = "literal", ["value"] = "On \$S\$-packing colourings of distance graphs \$D (1, t)\$ and \$D (1, 2, t)\$", ["xml:lang"] = "en", }, }, table#3334 { ["itemType"] = table#3335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2698533", }, ["subjectLabel"] = table#3337 { ["type"] = "literal", ["value"] = "Two completely independent spanning trees of \$P_4\$-free graphs", ["xml:lang"] = "en", }, }, table#3338 { ["itemType"] = table#3339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2700790", }, ["subjectLabel"] = table#3341 { ["type"] = "literal", ["value"] = "Many-to-many edge-disjoint paths in \$(n,k)\$-enhanced hypercube under three link-faulty hypotheses", ["xml:lang"] = "en", }, }, table#3342 { ["itemType"] = table#3343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2700996", }, ["subjectLabel"] = table#3345 { ["type"] = "literal", ["value"] = "Burling graphs revisited. I: New characterizations", ["xml:lang"] = "en", }, }, table#3346 { ["itemType"] = table#3347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2701116", }, ["subjectLabel"] = table#3349 { ["type"] = "literal", ["value"] = "Flow modules and nowhere-zero flows", ["xml:lang"] = "en", }, }, table#3350 { ["itemType"] = table#3351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2705007", }, ["subjectLabel"] = table#3353 { ["type"] = "literal", ["value"] = "On the point stabilizers of transitive groups with non-self-paired suborbits of length 2", ["xml:lang"] = "en", }, }, table#3354 { ["itemType"] = table#3355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2980025", }, ["subjectLabel"] = table#3357 { ["type"] = "literal", ["value"] = "The Hosoya Index and the Merrifield–Simmons Index of Some Nanostructures", ["xml:lang"] = "en", }, }, table#3358 { ["itemType"] = table#3359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2766101", }, ["subjectLabel"] = table#3361 { ["type"] = "literal", ["value"] = "Tenacity of complete graph products and grids", ["xml:lang"] = "en", }, }, table#3362 { ["itemType"] = table#3363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2987912", }, ["subjectLabel"] = table#3365 { ["type"] = "literal", ["value"] = "A rough set method for the vertex cover problem in graph theory", ["xml:lang"] = "en", }, }, table#3366 { ["itemType"] = table#3367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2993810", }, ["subjectLabel"] = table#3369 { ["type"] = "literal", ["value"] = "Wide diameter for two families of interconnection networks", ["xml:lang"] = "en", }, }, table#3370 { ["itemType"] = table#3371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3004656", }, ["subjectLabel"] = table#3373 { ["type"] = "literal", ["value"] = "Greedy Routing via Embedding Graphs onto Semi-metric Spaces", ["xml:lang"] = "en", }, }, table#3374 { ["itemType"] = table#3375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3004658", }, ["subjectLabel"] = table#3377 { ["type"] = "literal", ["value"] = "An Implicit Degree Condition for Cyclability in Graphs", ["xml:lang"] = "en", }, }, table#3378 { ["itemType"] = table#3379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3005868", }, ["subjectLabel"] = table#3381 { ["type"] = "literal", ["value"] = "Eigenvalues, Laplacian eigenvalues, and Hamiltonian connectivity of graphs", ["xml:lang"] = "en", }, }, table#3382 { ["itemType"] = table#3383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3007758", }, ["subjectLabel"] = table#3385 { ["type"] = "literal", ["value"] = "THE HYPER-WIENER INDEX OF THE kth POWER OF A GRAPH", ["xml:lang"] = "en", }, }, table#3386 { ["itemType"] = table#3387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2744573", }, ["subjectLabel"] = table#3389 { ["type"] = "literal", ["value"] = "On factors of 4-connected claw-free graphs", ["xml:lang"] = "en", }, }, table#3390 { ["itemType"] = table#3391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2746209", }, ["subjectLabel"] = table#3393 { ["type"] = "literal", ["value"] = "On the Thomassen's conjecture", ["xml:lang"] = "en", }, }, table#3394 { ["itemType"] = table#3395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3017398", }, ["subjectLabel"] = table#3397 { ["type"] = "literal", ["value"] = "2-Walk linear graphs with small number of cycles", ["xml:lang"] = "en", }, }, table#3398 { ["itemType"] = table#3399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3022733", }, ["subjectLabel"] = table#3401 { ["type"] = "literal", ["value"] = "On stability of the hamiltonian index under contractions and closures", ["xml:lang"] = "en", }, }, table#3402 { ["itemType"] = table#3403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3022735", }, ["subjectLabel"] = table#3405 { ["type"] = "literal", ["value"] = "Two sufficient conditions for dominating cycles", ["xml:lang"] = "en", }, }, table#3406 { ["itemType"] = table#3407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2760958", }, ["subjectLabel"] = table#3409 { ["type"] = "literal", ["value"] = "An Upper Bound on the Basis Number of the Powers of the Complete Graphs", ["xml:lang"] = "en", }, }, table#3410 { ["itemType"] = table#3411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2762312", }, ["subjectLabel"] = table#3413 { ["type"] = "literal", ["value"] = "The perturbed laplacian matrix of a graph", ["xml:lang"] = "en", }, }, table#3414 { ["itemType"] = table#3415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3032107", }, ["subjectLabel"] = table#3417 { ["type"] = "literal", ["value"] = "On cost allocation in communication networks", ["xml:lang"] = "en", }, }, table#3418 { ["itemType"] = table#3419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3033587", }, ["subjectLabel"] = table#3421 { ["type"] = "literal", ["value"] = "An algorithmic note on the gallai-milgram theorem", ["xml:lang"] = "en", }, }, table#3422 { ["itemType"] = table#3423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3039399", }, ["subjectLabel"] = table#3425 { ["type"] = "literal", ["value"] = "Infinite median graphs, (0, 2)-graphs, and hypercubes", ["xml:lang"] = "en", }, }, table#3426 { ["itemType"] = table#3427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2778283", }, ["subjectLabel"] = table#3429 { ["type"] = "literal", ["value"] = "Connected (g, f)-factors", ["xml:lang"] = "en", }, }, table#3430 { ["itemType"] = table#3431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3055900", }, ["subjectLabel"] = table#3433 { ["type"] = "literal", ["value"] = "Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian", ["xml:lang"] = "en", }, }, table#3434 { ["itemType"] = table#3435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2788720", }, ["subjectLabel"] = table#3437 { ["type"] = "literal", ["value"] = "The algorithm for adjacent vertex distinguishing proper edge coloring of graphs", ["xml:lang"] = "en", }, }, table#3438 { ["itemType"] = table#3439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2788738", }, ["subjectLabel"] = table#3441 { ["type"] = "literal", ["value"] = "On reachability in graphs with obstacles", ["xml:lang"] = "en", }, }, table#3442 { ["itemType"] = table#3443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3056357", }, ["subjectLabel"] = table#3445 { ["type"] = "literal", ["value"] = "A sufficient condition for a graph to be an (a, b, k)-critical graph", ["xml:lang"] = "en", }, }, table#3446 { ["itemType"] = table#3447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3056375", }, ["subjectLabel"] = table#3449 { ["type"] = "literal", ["value"] = "Signed clique-transversal functions in graphs", ["xml:lang"] = "en", }, }, table#3450 { ["itemType"] = table#3451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3057138", }, ["subjectLabel"] = table#3453 { ["type"] = "literal", ["value"] = "Sufficient conditions for a graph to be λ_k -optimal with given girth and diameter", ["xml:lang"] = "en", }, }, table#3454 { ["itemType"] = table#3455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3057163", }, ["subjectLabel"] = table#3457 { ["type"] = "literal", ["value"] = "Neighborhood conditions for graphs to be super restricted edge connected", ["xml:lang"] = "en", }, }, table#3458 { ["itemType"] = table#3459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3061188", }, ["subjectLabel"] = table#3461 { ["type"] = "literal", ["value"] = "Cycle and cocycle coverings of graphs", ["xml:lang"] = "en", }, }, table#3462 { ["itemType"] = table#3463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3063613", }, ["subjectLabel"] = table#3465 { ["type"] = "literal", ["value"] = "HAJÓS-LIKE THEOREM FOR GROUP COLORING", ["xml:lang"] = "en", }, }, table#3466 { ["itemType"] = table#3467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2798321", }, ["subjectLabel"] = table#3469 { ["type"] = "literal", ["value"] = "The genus of the balanced hypercube", ["xml:lang"] = "en", }, }, table#3470 { ["itemType"] = table#3471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3066980", }, ["subjectLabel"] = table#3473 { ["type"] = "literal", ["value"] = "On the fractionalf-chromatic index of a graph", ["xml:lang"] = "en", }, }, table#3474 { ["itemType"] = table#3475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3078472", }, ["subjectLabel"] = table#3477 { ["type"] = "literal", ["value"] = "An approximate chromatic number of a graph", ["xml:lang"] = "en", }, }, table#3478 { ["itemType"] = table#3479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2810955", }, ["subjectLabel"] = table#3481 { ["type"] = "literal", ["value"] = "Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version.", ["xml:lang"] = "en", }, }, table#3482 { ["itemType"] = table#3483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3081310", }, ["subjectLabel"] = table#3485 { ["type"] = "literal", ["value"] = "On stability of Hamilton-connectedness under the 2-closure in claw-free graphs", ["xml:lang"] = "en", }, }, table#3486 { ["itemType"] = table#3487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3081311", }, ["subjectLabel"] = table#3489 { ["type"] = "literal", ["value"] = "Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs", ["xml:lang"] = "en", }, }, table#3490 { ["itemType"] = table#3491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2813052", }, ["subjectLabel"] = table#3493 { ["type"] = "literal", ["value"] = "On Energy and Laplacian Energy of Graphs", ["xml:lang"] = "en", }, }, table#3494 { ["itemType"] = table#3495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3084264", }, ["subjectLabel"] = table#3497 { ["type"] = "literal", ["value"] = "On the Minimum Communication Effort for Secure Group Key Exchange", ["xml:lang"] = "en", }, }, table#3498 { ["itemType"] = table#3499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3087094", }, ["subjectLabel"] = table#3501 { ["type"] = "literal", ["value"] = "TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS", ["xml:lang"] = "en", }, }, table#3502 { ["itemType"] = table#3503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3087095", }, ["subjectLabel"] = table#3505 { ["type"] = "literal", ["value"] = "EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED", ["xml:lang"] = "en", }, }, table#3506 { ["itemType"] = table#3507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2821116", }, ["subjectLabel"] = table#3509 { ["type"] = "literal", ["value"] = "Certain chromatic sums of some cycle-related graph classes", ["xml:lang"] = "en", }, }, table#3510 { ["itemType"] = table#3511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3090741", }, ["subjectLabel"] = table#3513 { ["type"] = "literal", ["value"] = "A further result on majorization theorem", ["xml:lang"] = "en", }, }, table#3514 { ["itemType"] = table#3515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3094636", }, ["subjectLabel"] = table#3517 { ["type"] = "literal", ["value"] = "EXPONENTIAL STABILISATION OF A TREE-SHAPED NETWORK OF STRINGS WITH VARIABLE COEFFICIENTS", ["xml:lang"] = "en", }, }, table#3518 { ["itemType"] = table#3519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3100700", }, ["subjectLabel"] = table#3521 { ["type"] = "literal", ["value"] = "Graph labelings derived from models in distributed computing: A complete complexity classification", ["xml:lang"] = "en", }, }, table#3522 { ["itemType"] = table#3523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2831790", }, ["subjectLabel"] = table#3525 { ["type"] = "literal", ["value"] = "Energy and the First Zagreb Index Conditions for Some Stable Properties of Graphs", ["xml:lang"] = "en", }, }, table#3526 { ["itemType"] = table#3527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2832671", }, ["subjectLabel"] = table#3529 { ["type"] = "literal", ["value"] = "Eigenvalues of thek-th power of a graph", ["xml:lang"] = "en", }, }, table#3530 { ["itemType"] = table#3531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2839223", }, ["subjectLabel"] = table#3533 { ["type"] = "literal", ["value"] = "On Equitable Coloring of Central Graphs and Total Graphs", ["xml:lang"] = "en", }, }, table#3534 { ["itemType"] = table#3535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2839246", }, ["subjectLabel"] = table#3537 { ["type"] = "literal", ["value"] = "On Harmonious Colouring of and", ["xml:lang"] = "en", }, }, table#3538 { ["itemType"] = table#3539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2839258", }, ["subjectLabel"] = table#3541 { ["type"] = "literal", ["value"] = "Generalization of Achromatic Colouring of Central Graphs", ["xml:lang"] = "en", }, }, table#3542 { ["itemType"] = table#3543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2862549", }, ["subjectLabel"] = table#3545 { ["type"] = "literal", ["value"] = "Ons-Hamiltonian Line Graphs", ["xml:lang"] = "en", }, }, table#3546 { ["itemType"] = table#3547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2865121", }, ["subjectLabel"] = table#3549 { ["type"] = "literal", ["value"] = "ON THE REGULAR DIGRAPH OF IDEALS OF COMMUTATIVE RINGS", ["xml:lang"] = "en", }, }, table#3550 { ["itemType"] = table#3551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2866735", }, ["subjectLabel"] = table#3553 { ["type"] = "literal", ["value"] = "Modal Expressiveness of Graph Properties", ["xml:lang"] = "en", }, }, table#3554 { ["itemType"] = table#3555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2957665", }, ["subjectLabel"] = table#3557 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2957665", }, }, table#3558 { ["itemType"] = table#3559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2874034", }, ["subjectLabel"] = table#3561 { ["type"] = "literal", ["value"] = "CONNECTIVITY OF TENSOR PRODUCT OF GRAPHS", ["xml:lang"] = "en", }, }, table#3562 { ["itemType"] = table#3563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2874039", }, ["subjectLabel"] = table#3565 { ["type"] = "literal", ["value"] = "A NOTE ON RAINBOW MATCHINGS", ["xml:lang"] = "en", }, }, table#3566 { ["itemType"] = table#3567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2874048", }, ["subjectLabel"] = table#3569 { ["type"] = "literal", ["value"] = "TOTAL GRAPHS OF POLYNOMIAL RINGS AND RINGS OF FRACTIONS", ["xml:lang"] = "en", }, }, table#3570 { ["itemType"] = table#3571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2874307", }, ["subjectLabel"] = table#3573 { ["type"] = "literal", ["value"] = "Onm-restricted edge connectivity of undirected generalized De Bruijn graphs", ["xml:lang"] = "en", }, }, table#3574 { ["itemType"] = table#3575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2874699", }, ["subjectLabel"] = table#3577 { ["type"] = "literal", ["value"] = "On cyclic graphs of finite semigroups", ["xml:lang"] = "en", }, }, table#3578 { ["itemType"] = table#3579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1613397", }, ["subjectLabel"] = table#3581 { ["type"] = "literal", ["value"] = "NeST graphs", ["xml:lang"] = "en", }, }, table#3582 { ["itemType"] = table#3583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1613399", }, ["subjectLabel"] = table#3585 { ["type"] = "literal", ["value"] = "Pushing vertices in digraphs without long induced cycles", ["xml:lang"] = "en", }, }, table#3586 { ["itemType"] = table#3587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1327237", }, ["subjectLabel"] = table#3589 { ["type"] = "literal", ["value"] = "Total matchings and total coverings of threshold graphs", ["xml:lang"] = "en", }, }, table#3590 { ["itemType"] = table#3591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1327828", }, ["subjectLabel"] = table#3593 { ["type"] = "literal", ["value"] = "Profile minimization problem for matrices and graphs", ["xml:lang"] = "en", }, }, table#3594 { ["itemType"] = table#3595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1617001", }, ["subjectLabel"] = table#3597 { ["type"] = "literal", ["value"] = "Super edge-connectivity and zeroth-order general Randić index for \$-1 \\leq \\alpha < 0\$", ["xml:lang"] = "en", }, }, table#3598 { ["itemType"] = table#3599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1617036", }, ["subjectLabel"] = table#3601 { ["type"] = "literal", ["value"] = "Improved upper bound for generalized acyclic chromatic number of graphs", ["xml:lang"] = "en", }, }, table#3602 { ["itemType"] = table#3603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1329789", }, ["subjectLabel"] = table#3605 { ["type"] = "literal", ["value"] = "Periodic assignment and graph colouring", ["xml:lang"] = "en", }, }, table#3606 { ["itemType"] = table#3607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1617680", }, ["subjectLabel"] = table#3609 { ["type"] = "literal", ["value"] = "On the structure of isoclinism classes of the non-commuting graphs", ["xml:lang"] = "en", }, }, table#3610 { ["itemType"] = table#3611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1330800", }, ["subjectLabel"] = table#3613 { ["type"] = "literal", ["value"] = "Cycles through \$k\$ vertices in bipartite tournaments", ["xml:lang"] = "en", }, }, table#3614 { ["itemType"] = table#3615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1619615", }, ["subjectLabel"] = table#3617 { ["type"] = "literal", ["value"] = "Monomer-dimer problem on some networks", ["xml:lang"] = "en", }, }, table#3618 { ["itemType"] = table#3619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1332310", }, ["subjectLabel"] = table#3621 { ["type"] = "literal", ["value"] = "Near-perfect matrices", ["xml:lang"] = "en", }, }, table#3622 { ["itemType"] = table#3623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1620403", }, ["subjectLabel"] = table#3625 { ["type"] = "literal", ["value"] = "Multifractal analysis and topological properties of a new family of weighted Koch networks", ["xml:lang"] = "en", }, }, table#3626 { ["itemType"] = table#3627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1334626", }, ["subjectLabel"] = table#3629 { ["type"] = "literal", ["value"] = "Exact solutions for the construction of optimal length test sequences", ["xml:lang"] = "en", }, }, table#3630 { ["itemType"] = table#3631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1334935", }, ["subjectLabel"] = table#3633 { ["type"] = "literal", ["value"] = "Toughness of graphs and \$[2,b]\$-factors", ["xml:lang"] = "en", }, }, table#3634 { ["itemType"] = table#3635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1334943", }, ["subjectLabel"] = table#3637 { ["type"] = "literal", ["value"] = "Two edge-disjoint Hamiltonian cycles in graphs", ["xml:lang"] = "en", }, }, table#3638 { ["itemType"] = table#3639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1625491", }, ["subjectLabel"] = table#3641 { ["type"] = "literal", ["value"] = "Length bounds for cycle bases of graphs", ["xml:lang"] = "en", }, }, table#3642 { ["itemType"] = table#3643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1625797", }, ["subjectLabel"] = table#3645 { ["type"] = "literal", ["value"] = "Oddness to resistance ratios in cubic graphs", ["xml:lang"] = "en", }, }, table#3646 { ["itemType"] = table#3647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1625810", }, ["subjectLabel"] = table#3649 { ["type"] = "literal", ["value"] = "Perfect matchings extend to two or more Hamiltonian cycles in hypercubes", ["xml:lang"] = "en", }, }, table#3650 { ["itemType"] = table#3651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1627873", }, ["subjectLabel"] = table#3653 { ["type"] = "literal", ["value"] = "The anti-adjacency matrix of a graph: eccentricity matrix", ["xml:lang"] = "en", }, }, table#3654 { ["itemType"] = table#3655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1627882", }, ["subjectLabel"] = table#3657 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total chromatic number of 2-degenerate graphs", ["xml:lang"] = "en", }, }, table#3658 { ["itemType"] = table#3659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1339170", }, ["subjectLabel"] = table#3661 { ["type"] = "literal", ["value"] = "Comparing proposals for the solution of data analysis problems in a knowledge-based system", ["xml:lang"] = "en", }, }, table#3662 { ["itemType"] = table#3663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1340072", }, ["subjectLabel"] = table#3665 { ["type"] = "literal", ["value"] = "On the \$k\$-cut subgraph polytope", ["xml:lang"] = "en", }, }, table#3666 { ["itemType"] = table#3667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1340118", }, ["subjectLabel"] = table#3669 { ["type"] = "literal", ["value"] = "Size, chromatic number, and connectivity", ["xml:lang"] = "en", }, }, table#3670 { ["itemType"] = table#3671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1340124", }, ["subjectLabel"] = table#3673 { ["type"] = "literal", ["value"] = "Every 4-connected line graph of a planar graph is Hamiltonian", ["xml:lang"] = "en", }, }, table#3674 { ["itemType"] = table#3675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1341252", }, ["subjectLabel"] = table#3677 { ["type"] = "literal", ["value"] = "An extension of Whitney's theorem to infinite strong triangulations", ["xml:lang"] = "en", }, }, table#3678 { ["itemType"] = table#3679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1630923", }, ["subjectLabel"] = table#3681 { ["type"] = "literal", ["value"] = "An efficient polynomial time approximation scheme for the vertex cover \$P_3\$ problem on planar graphs", ["xml:lang"] = "en", }, }, table#3682 { ["itemType"] = table#3683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1341682", }, ["subjectLabel"] = table#3685 { ["type"] = "literal", ["value"] = "Path for AND-parallel execution of logic programs", ["xml:lang"] = "en", }, }, table#3686 { ["itemType"] = table#3687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1631690", }, ["subjectLabel"] = table#3689 { ["type"] = "literal", ["value"] = "List 2-distance \$\\varDelta +3\$-coloring of planar graphs without 4,5-cycles", ["xml:lang"] = "en", }, }, table#3690 { ["itemType"] = table#3691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1343227", }, ["subjectLabel"] = table#3693 { ["type"] = "literal", ["value"] = "On edge semi-isomorphisms and semi-dualities of graphs", ["xml:lang"] = "en", }, }, table#3694 { ["itemType"] = table#3695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1343229", }, ["subjectLabel"] = table#3697 { ["type"] = "literal", ["value"] = "A short proof of a theorem of Reid and Parker on tournaments", ["xml:lang"] = "en", }, }, table#3698 { ["itemType"] = table#3699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1343255", }, ["subjectLabel"] = table#3701 { ["type"] = "literal", ["value"] = "\$k\$-cycle resonant graphs", ["xml:lang"] = "en", }, }, table#3702 { ["itemType"] = table#3703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1343779", }, ["subjectLabel"] = table#3705 { ["type"] = "literal", ["value"] = "A homology theory for colored graphs", ["xml:lang"] = "en", }, }, table#3706 { ["itemType"] = table#3707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1343791", }, ["subjectLabel"] = table#3709 { ["type"] = "literal", ["value"] = "Longest cycles in regular 2-connected claw-free graphs", ["xml:lang"] = "en", }, }, table#3710 { ["itemType"] = table#3711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1633669", }, ["subjectLabel"] = table#3713 { ["type"] = "literal", ["value"] = "Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria", ["xml:lang"] = "en", }, }, table#3714 { ["itemType"] = table#3715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1344643", }, ["subjectLabel"] = table#3717 { ["type"] = "literal", ["value"] = "The gracefulness of a class of lobster trees", ["xml:lang"] = "en", }, }, table#3718 { ["itemType"] = table#3719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1346424", }, ["subjectLabel"] = table#3721 { ["type"] = "literal", ["value"] = "Five surprising properties of parsimoniously colored trees", ["xml:lang"] = "en", }, }, table#3722 { ["itemType"] = table#3723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1637078", }, ["subjectLabel"] = table#3725 { ["type"] = "literal", ["value"] = "On the characterization of maximal planar graphs with a given signed cycle domination number", ["xml:lang"] = "en", }, }, table#3726 { ["itemType"] = table#3727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1637135", }, ["subjectLabel"] = table#3729 { ["type"] = "literal", ["value"] = "\$2p\$-cycle decompositions of some regular graphs and digraphs", ["xml:lang"] = "en", }, }, table#3730 { ["itemType"] = table#3731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1637136", }, ["subjectLabel"] = table#3733 { ["type"] = "literal", ["value"] = "The List \$L(2, 1)\$-labeling of planar graphs", ["xml:lang"] = "en", }, }, table#3734 { ["itemType"] = table#3735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1349306", }, ["subjectLabel"] = table#3737 { ["type"] = "literal", ["value"] = "Connectivities of minimal Cayley coset digraphs", ["xml:lang"] = "en", }, }, table#3738 { ["itemType"] = table#3739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1353938", }, ["subjectLabel"] = table#3741 { ["type"] = "literal", ["value"] = "Proving Ramsey's theory by the cover set induction: A case and comparision study.", ["xml:lang"] = "en", }, }, table#3742 { ["itemType"] = table#3743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1355197", }, ["subjectLabel"] = table#3745 { ["type"] = "literal", ["value"] = "Grid embedding of 4-connected plane graphs", ["xml:lang"] = "en", }, }, table#3746 { ["itemType"] = table#3747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1356207", }, ["subjectLabel"] = table#3749 { ["type"] = "literal", ["value"] = "On renamable Horn and generalized Horn functions", ["xml:lang"] = "en", }, }, table#3750 { ["itemType"] = table#3751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1356546", }, ["subjectLabel"] = table#3753 { ["type"] = "literal", ["value"] = "Vertex heaviest paths and cycles in quasi-transitive digraphs", ["xml:lang"] = "en", }, }, table#3754 { ["itemType"] = table#3755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1356728", }, ["subjectLabel"] = table#3757 { ["type"] = "literal", ["value"] = "Alternating cycles and paths in edge-coloured multigraphs: A survey", ["xml:lang"] = "en", }, }, table#3758 { ["itemType"] = table#3759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1359181", }, ["subjectLabel"] = table#3761 { ["type"] = "literal", ["value"] = "Powers of circulants in bottleneck algebra", ["xml:lang"] = "en", }, }, table#3762 { ["itemType"] = table#3763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1359372", }, ["subjectLabel"] = table#3765 { ["type"] = "literal", ["value"] = "A class of edge critical 4-chromatic graphs", ["xml:lang"] = "en", }, }, table#3766 { ["itemType"] = table#3767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1359373", }, ["subjectLabel"] = table#3769 { ["type"] = "literal", ["value"] = "A note on matchings and spanning trees with bounded degrees", ["xml:lang"] = "en", }, }, table#3770 { ["itemType"] = table#3771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1359377", }, ["subjectLabel"] = table#3773 { ["type"] = "literal", ["value"] = "Ordered and canonical Ramsey numbers of stars", ["xml:lang"] = "en", }, }, table#3774 { ["itemType"] = table#3775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1363017", }, ["subjectLabel"] = table#3777 { ["type"] = "literal", ["value"] = "On the complete chromatic number of Halin graphs", ["xml:lang"] = "en", }, }, table#3778 { ["itemType"] = table#3779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1363414", }, ["subjectLabel"] = table#3781 { ["type"] = "literal", ["value"] = "Fractional and integral colourings", ["xml:lang"] = "en", }, }, table#3782 { ["itemType"] = table#3783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1363656", }, ["subjectLabel"] = table#3785 { ["type"] = "literal", ["value"] = "1-tough cocomparability graphs are hamiltonian", ["xml:lang"] = "en", }, }, table#3786 { ["itemType"] = table#3787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1366781", }, ["subjectLabel"] = table#3789 { ["type"] = "literal", ["value"] = "Adjoint polynomials and chromatically unique graphs", ["xml:lang"] = "en", }, }, table#3790 { ["itemType"] = table#3791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1367046", }, ["subjectLabel"] = table#3793 { ["type"] = "literal", ["value"] = "On the bandwidth of convex triangulation meshes", ["xml:lang"] = "en", }, }, table#3794 { ["itemType"] = table#3795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1372743", }, ["subjectLabel"] = table#3797 { ["type"] = "literal", ["value"] = "Small cycles in Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#3798 { ["itemType"] = table#3799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1375344", }, ["subjectLabel"] = table#3801 { ["type"] = "literal", ["value"] = "The diameters of almost all Cayley digraphs", ["xml:lang"] = "en", }, }, table#3802 { ["itemType"] = table#3803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1375625", }, ["subjectLabel"] = table#3805 { ["type"] = "literal", ["value"] = "Estimations for the number of cycles in a graph", ["xml:lang"] = "en", }, }, table#3806 { ["itemType"] = table#3807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1375824", }, ["subjectLabel"] = table#3809 { ["type"] = "literal", ["value"] = "\$(a,b,k)\$-critical graphs", ["xml:lang"] = "en", }, }, table#3810 { ["itemType"] = table#3811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1376060", }, ["subjectLabel"] = table#3813 { ["type"] = "literal", ["value"] = "Subgraphs with restricted degrees of their vertices in planar 3-connected graphs", ["xml:lang"] = "en", }, }, table#3814 { ["itemType"] = table#3815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1376065", }, ["subjectLabel"] = table#3817 { ["type"] = "literal", ["value"] = "On a conjecture on directed cycles in a directed bipartite graph", ["xml:lang"] = "en", }, }, table#3818 { ["itemType"] = table#3819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1376076", }, ["subjectLabel"] = table#3821 { ["type"] = "literal", ["value"] = "Uniquely total colorable graphs", ["xml:lang"] = "en", }, }, table#3822 { ["itemType"] = table#3823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1377186", }, ["subjectLabel"] = table#3825 { ["type"] = "literal", ["value"] = "The total chromatic number of pseudo-outerplanar graphs", ["xml:lang"] = "en", }, }, table#3826 { ["itemType"] = table#3827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1377191", }, ["subjectLabel"] = table#3829 { ["type"] = "literal", ["value"] = "\$K_{1,k}\$-factorization of bipartite graphs", ["xml:lang"] = "en", }, }, table#3830 { ["itemType"] = table#3831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1380416", }, ["subjectLabel"] = table#3833 { ["type"] = "literal", ["value"] = "The complexity of minimum partial truth assignments and implication in negation-free formulae", ["xml:lang"] = "en", }, }, table#3834 { ["itemType"] = table#3835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1382273", }, ["subjectLabel"] = table#3837 { ["type"] = "literal", ["value"] = "Broadcast and gossip in line-communication mode", ["xml:lang"] = "en", }, }, table#3838 { ["itemType"] = table#3839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1387427", }, ["subjectLabel"] = table#3841 { ["type"] = "literal", ["value"] = "A note on \$n\$-edge chromatic number", ["xml:lang"] = "en", }, }, table#3842 { ["itemType"] = table#3843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1387472", }, ["subjectLabel"] = table#3845 { ["type"] = "literal", ["value"] = "On one of Graffiti's conjectures (583)", ["xml:lang"] = "en", }, }, table#3846 { ["itemType"] = table#3847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1389600", }, ["subjectLabel"] = table#3849 { ["type"] = "literal", ["value"] = "Determination of social laws for multi-agent mobilization", ["xml:lang"] = "en", }, }, table#3850 { ["itemType"] = table#3851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1389729", }, ["subjectLabel"] = table#3853 { ["type"] = "literal", ["value"] = "Characterizing and efficiently computing quadrangulations of planar point sets", ["xml:lang"] = "en", }, }, table#3854 { ["itemType"] = table#3855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1401312", }, ["subjectLabel"] = table#3857 { ["type"] = "literal", ["value"] = "Uniform multi-hop all-to-all optical routings in rings.", ["xml:lang"] = "en", }, }, table#3858 { ["itemType"] = table#3859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1410592", }, ["subjectLabel"] = table#3861 { ["type"] = "literal", ["value"] = "Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces", ["xml:lang"] = "en", }, }, table#3862 { ["itemType"] = table#3863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1412674", }, ["subjectLabel"] = table#3865 { ["type"] = "literal", ["value"] = "Some work towards the proof of the reconstruction conjecture", ["xml:lang"] = "en", }, }, table#3866 { ["itemType"] = table#3867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1413709", }, ["subjectLabel"] = table#3869 { ["type"] = "literal", ["value"] = "The roots of \$\\sigma\$-polynomials", ["xml:lang"] = "en", }, }, table#3870 { ["itemType"] = table#3871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1413710", }, ["subjectLabel"] = table#3873 { ["type"] = "literal", ["value"] = "Maximum cutwidth problem for graphs.", ["xml:lang"] = "en", }, }, table#3874 { ["itemType"] = table#3875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1414583", }, ["subjectLabel"] = table#3877 { ["type"] = "literal", ["value"] = "On local and global independence numbers of a graph", ["xml:lang"] = "en", }, }, table#3878 { ["itemType"] = table#3879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1415544", }, ["subjectLabel"] = table#3881 { ["type"] = "literal", ["value"] = "On the equality of the partial Grundy and upper ochromatic numbers of graphs", ["xml:lang"] = "en", }, }, table#3882 { ["itemType"] = table#3883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1421090", }, ["subjectLabel"] = table#3885 { ["type"] = "literal", ["value"] = "\$c\$-pancyclic partial ordering and \$(c-1)\$-pan-outpath partial ordering in semicomplete multipartite digraphs.", ["xml:lang"] = "en", }, }, table#3886 { ["itemType"] = table#3887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1426008", }, ["subjectLabel"] = table#3889 { ["type"] = "literal", ["value"] = "Some connections between bounded query classes and non-uniform complexity.", ["xml:lang"] = "en", }, }, table#3890 { ["itemType"] = table#3891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1430969", }, ["subjectLabel"] = table#3893 { ["type"] = "literal", ["value"] = "The cutwidth of trees with diameters at most 4", ["xml:lang"] = "en", }, }, table#3894 { ["itemType"] = table#3895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1432858", }, ["subjectLabel"] = table#3897 { ["type"] = "literal", ["value"] = "Maximum genus of strong embeddings", ["xml:lang"] = "en", }, }, table#3898 { ["itemType"] = table#3899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1432869", }, ["subjectLabel"] = table#3901 { ["type"] = "literal", ["value"] = "Bound on \$m\$-restricted edge connectivity", ["xml:lang"] = "en", }, }, table#3902 { ["itemType"] = table#3903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1565868", }, ["subjectLabel"] = table#3905 { ["type"] = "literal", ["value"] = "Cabri-graph, a sketchpad for graph theory.", ["xml:lang"] = "en", }, }, table#3906 { ["itemType"] = table#3907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1566067", }, ["subjectLabel"] = table#3909 { ["type"] = "literal", ["value"] = "Cycles containing a given arc in regular multipartite tournaments", ["xml:lang"] = "en", }, }, table#3910 { ["itemType"] = table#3911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1570830", }, ["subjectLabel"] = table#3913 { ["type"] = "literal", ["value"] = "On shortest three-edge-connected Steiner networks with Euclidean distance", ["xml:lang"] = "en", }, }, table#3914 { ["itemType"] = table#3915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1578861", }, ["subjectLabel"] = table#3917 { ["type"] = "literal", ["value"] = "On the Birch-Swinnerton-Dyer conjecture of elliptic curves \$E_D:y^2 = x^3-D^2 x\$", ["xml:lang"] = "en", }, }, table#3918 { ["itemType"] = table#3919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1582078", }, ["subjectLabel"] = table#3921 { ["type"] = "literal", ["value"] = "Characterizations of some classes of strong sign nonsingular digraphs", ["xml:lang"] = "en", }, }, table#3922 { ["itemType"] = table#3923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1582086", }, ["subjectLabel"] = table#3925 { ["type"] = "literal", ["value"] = "Plane elementary bipartite graphs", ["xml:lang"] = "en", }, }, table#3926 { ["itemType"] = table#3927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1582579", }, ["subjectLabel"] = table#3929 { ["type"] = "literal", ["value"] = "The broadcast function value \$B(23)\$ is \$33\$ or \$34\$.", ["xml:lang"] = "en", }, }, table#3930 { ["itemType"] = table#3931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1583053", }, ["subjectLabel"] = table#3933 { ["type"] = "literal", ["value"] = "On the isomorphism of expressions", ["xml:lang"] = "en", }, }, table#3934 { ["itemType"] = table#3935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1584229", }, ["subjectLabel"] = table#3937 { ["type"] = "literal", ["value"] = "A study of the total chromatic number of equibipartite graphs", ["xml:lang"] = "en", }, }, table#3938 { ["itemType"] = table#3939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1584277", }, ["subjectLabel"] = table#3941 { ["type"] = "literal", ["value"] = "Matchings and matching extensions in graphs", ["xml:lang"] = "en", }, }, table#3942 { ["itemType"] = table#3943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1584322", }, ["subjectLabel"] = table#3945 { ["type"] = "literal", ["value"] = "Alternating cycles and trails in \$2\$-edge-coloured complete multigraphs", ["xml:lang"] = "en", }, }, table#3946 { ["itemType"] = table#3947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1584331", }, ["subjectLabel"] = table#3949 { ["type"] = "literal", ["value"] = "Vertex pancyclism in claw-free graphs", ["xml:lang"] = "en", }, }, table#3950 { ["itemType"] = table#3951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1594865", }, ["subjectLabel"] = table#3953 { ["type"] = "literal", ["value"] = "On conditional edge-connectivity of graphs", ["xml:lang"] = "en", }, }, table#3954 { ["itemType"] = table#3955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1601389", }, ["subjectLabel"] = table#3957 { ["type"] = "literal", ["value"] = "On the immersion relation and an embedding problem for infinite graphs", ["xml:lang"] = "en", }, }, table#3958 { ["itemType"] = table#3959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1601403", }, ["subjectLabel"] = table#3961 { ["type"] = "literal", ["value"] = "Chromatic number of graphs each path of which is 3-colourable", ["xml:lang"] = "en", }, }, table#3962 { ["itemType"] = table#3963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1606329", }, ["subjectLabel"] = table#3965 { ["type"] = "literal", ["value"] = "A comparison of point-based approaches to qualitative temporal reasoning", ["xml:lang"] = "en", }, }, table#3966 { ["itemType"] = table#3967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1607520", }, ["subjectLabel"] = table#3969 { ["type"] = "literal", ["value"] = "\$(d,m)\$-dominating numbers of hypercube", ["xml:lang"] = "en", }, }, table#3970 { ["itemType"] = table#3971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1608859", }, ["subjectLabel"] = table#3973 { ["type"] = "literal", ["value"] = "Experimental results on quadrangulations of sets of fixed points", ["xml:lang"] = "en", }, }, table#3974 { ["itemType"] = table#3975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1609706", }, ["subjectLabel"] = table#3977 { ["type"] = "literal", ["value"] = "Extremal hexagonal chains concerning largest eigenvalue", ["xml:lang"] = "en", }, }, table#3978 { ["itemType"] = table#3979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4780531", }, ["subjectLabel"] = table#3981 { ["type"] = "literal", ["value"] = "Computing the Scattering Number of Graphs", ["xml:lang"] = "en", }, }, table#3982 { ["itemType"] = table#3983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4792821", }, ["subjectLabel"] = table#3985 { ["type"] = "literal", ["value"] = "Finite graphs of valency 4 and girth 4 admitting half-transitive group actions", ["xml:lang"] = "en", }, }, table#3986 { ["itemType"] = table#3987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4796447", }, ["subjectLabel"] = table#3989 { ["type"] = "literal", ["value"] = "Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow", ["xml:lang"] = "en", }, }, table#3990 { ["itemType"] = table#3991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4797927", }, ["subjectLabel"] = table#3993 { ["type"] = "literal", ["value"] = "On removable cycles through every edge", ["xml:lang"] = "en", }, }, table#3994 { ["itemType"] = table#3995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4713353", }, ["subjectLabel"] = table#3997 { ["type"] = "literal", ["value"] = "Quasi-Random Set Systems", ["xml:lang"] = "en", }, }, table#3998 { ["itemType"] = table#3999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4800400", }, ["subjectLabel"] = table#4001 { ["type"] = "literal", ["value"] = "Nowhere‐zero 3‐flows in locally connected graphs", ["xml:lang"] = "en", }, }, table#4002 { ["itemType"] = table#4003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4810959", }, ["subjectLabel"] = table#4005 { ["type"] = "literal", ["value"] = "Vulnerability in graphs of diameter five", ["xml:lang"] = "en", }, }, table#4006 { ["itemType"] = table#4007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4685890", }, ["subjectLabel"] = table#4009 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4685890", }, }, table#4010 { ["itemType"] = table#4011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4555270", }, ["subjectLabel"] = table#4013 { ["type"] = "literal", ["value"] = "Towards Identifying and Predicting Spatial Epidemics on Complex Meta-population Networks", ["xml:lang"] = "en", }, }, table#4014 { ["itemType"] = table#4015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4557579", }, ["subjectLabel"] = table#4017 { ["type"] = "literal", ["value"] = "The Group Inverse of the Laplacian Matrix of a Graph", ["xml:lang"] = "en", }, }, table#4018 { ["itemType"] = table#4019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4819984", }, ["subjectLabel"] = table#4021 { ["type"] = "literal", ["value"] = "AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS", ["xml:lang"] = "en", }, }, table#4022 { ["itemType"] = table#4023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4820124", }, ["subjectLabel"] = table#4025 { ["type"] = "literal", ["value"] = "ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING", ["xml:lang"] = "en", }, }, table#4026 { ["itemType"] = table#4027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4593248", }, ["subjectLabel"] = table#4029 { ["type"] = "literal", ["value"] = "Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs", ["xml:lang"] = "en", }, }, table#4030 { ["itemType"] = table#4031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4566058", }, ["subjectLabel"] = table#4033 { ["type"] = "literal", ["value"] = "On the regular graph of ideals of total ring of fractions", ["xml:lang"] = "en", }, }, table#4034 { ["itemType"] = table#4035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4568228", }, ["subjectLabel"] = table#4037 { ["type"] = "literal", ["value"] = "On $g_c$-colorings of nearly bipartite graphs", ["xml:lang"] = "en", }, }, table#4038 { ["itemType"] = table#4039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4831401", }, ["subjectLabel"] = table#4041 { ["type"] = "literal", ["value"] = "Relationships between scattering number and other vulnerability parameters", ["xml:lang"] = "en", }, }, table#4042 { ["itemType"] = table#4043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4571981", }, ["subjectLabel"] = table#4045 { ["type"] = "literal", ["value"] = "Colouring paths in directed symmetric trees with applications to WDM routing", ["xml:lang"] = "en", }, }, table#4046 { ["itemType"] = table#4047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4835422", }, ["subjectLabel"] = table#4049 { ["type"] = "literal", ["value"] = "A note on graphs with a prescribed adjacency property", ["xml:lang"] = "en", }, }, table#4050 { ["itemType"] = table#4051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4576812", }, ["subjectLabel"] = table#4053 { ["type"] = "literal", ["value"] = "ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS", ["xml:lang"] = "en", }, }, table#4054 { ["itemType"] = table#4055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4576832", }, ["subjectLabel"] = table#4057 { ["type"] = "literal", ["value"] = "TANGENT BUNDLES, MONOIDAL THEORIES AND WEIL ALGEBRAS", ["xml:lang"] = "en", }, }, table#4058 { ["itemType"] = table#4059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4577863", }, ["subjectLabel"] = table#4061 { ["type"] = "literal", ["value"] = "Gregarious star factorization of the tensor product of graphs", ["xml:lang"] = "en", }, }, table#4062 { ["itemType"] = table#4063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4842703", }, ["subjectLabel"] = table#4065 { ["type"] = "literal", ["value"] = "Oriented hamilton cycles in digraphs", ["xml:lang"] = "en", }, }, table#4066 { ["itemType"] = table#4067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4842704", }, ["subjectLabel"] = table#4069 { ["type"] = "literal", ["value"] = "Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey", ["xml:lang"] = "en", }, }, table#4070 { ["itemType"] = table#4071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4843509", }, ["subjectLabel"] = table#4073 { ["type"] = "literal", ["value"] = "Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs", ["xml:lang"] = "en", }, }, table#4074 { ["itemType"] = table#4075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4585768", }, ["subjectLabel"] = table#4077 { ["type"] = "literal", ["value"] = "When is the Jacobson graph projective?", ["xml:lang"] = "en", }, }, table#4078 { ["itemType"] = table#4079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4851927", }, ["subjectLabel"] = table#4081 { ["type"] = "literal", ["value"] = "The Ramsey number R(3, t) has order of magnitude t²/log t", ["xml:lang"] = "en", }, }, table#4082 { ["itemType"] = table#4083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4852403", }, ["subjectLabel"] = table#4085 { ["type"] = "literal", ["value"] = "Degree‐bounded coloring of graphs: Variations on a theme by brooks", ["xml:lang"] = "en", }, }, table#4086 { ["itemType"] = table#4087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4852406", }, ["subjectLabel"] = table#4089 { ["type"] = "literal", ["value"] = "Relative length of long paths and cycles in graphs with large degree sums", ["xml:lang"] = "en", }, }, table#4090 { ["itemType"] = table#4091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4857424", }, ["subjectLabel"] = table#4093 { ["type"] = "literal", ["value"] = "Hamiltonicity of 5‐Connected Toroidal Triangulations", ["xml:lang"] = "en", }, }, table#4094 { ["itemType"] = table#4095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4857433", }, ["subjectLabel"] = table#4097 { ["type"] = "literal", ["value"] = "2‐connected coverings of bounded degree in 3‐connected graphs", ["xml:lang"] = "en", }, }, table#4098 { ["itemType"] = table#4099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4857442", }, ["subjectLabel"] = table#4101 { ["type"] = "literal", ["value"] = "Hamiltonicity for K_{1, r}‐free graphs", ["xml:lang"] = "en", }, }, table#4102 { ["itemType"] = table#4103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4857444", }, ["subjectLabel"] = table#4105 { ["type"] = "literal", ["value"] = "Hamiltonian cycles in 2‐connected claw‐free‐graphs", ["xml:lang"] = "en", }, }, table#4106 { ["itemType"] = table#4107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4698132", }, ["subjectLabel"] = table#4109 { ["type"] = "literal", ["value"] = "Dual criteria preemptive open-shop problems with minimum makespan", ["xml:lang"] = "en", }, }, table#4110 { ["itemType"] = table#4111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4700527", }, ["subjectLabel"] = table#4113 { ["type"] = "literal", ["value"] = "Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments", ["xml:lang"] = "en", }, }, table#4114 { ["itemType"] = table#4115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4700528", }, ["subjectLabel"] = table#4117 { ["type"] = "literal", ["value"] = "Diregularc-partite tournaments are vertex-pancyclic whenc ? 5", ["xml:lang"] = "en", }, }, table#4118 { ["itemType"] = table#4119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4603783", }, ["subjectLabel"] = table#4121 { ["type"] = "literal", ["value"] = "On computing of a conditional edge connectivity of alternating group network", ["xml:lang"] = "en", }, }, table#4122 { ["itemType"] = table#4123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4604531", }, ["subjectLabel"] = table#4125 { ["type"] = "literal", ["value"] = "Properties, proved and conjectured, of Keller, Mycielski, and queen graphs", ["xml:lang"] = "en", }, }, table#4126 { ["itemType"] = table#4127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4605444", }, ["subjectLabel"] = table#4129 { ["type"] = "literal", ["value"] = "Additive Bases and Flows in Graphs", ["xml:lang"] = "en", }, }, table#4130 { ["itemType"] = table#4131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4611485", }, ["subjectLabel"] = table#4133 { ["type"] = "literal", ["value"] = "Network robustness and residual closeness", ["xml:lang"] = "en", }, }, table#4134 { ["itemType"] = table#4135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4616893", }, ["subjectLabel"] = table#4137 { ["type"] = "literal", ["value"] = "A model of a human heart via graph nano topological spaces", ["xml:lang"] = "en", }, }, table#4138 { ["itemType"] = table#4139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4630259", }, ["subjectLabel"] = table#4141 { ["type"] = "literal", ["value"] = "A simple method for resolving degeneracies in Delaunay triangulations", ["xml:lang"] = "en", }, }, table#4142 { ["itemType"] = table#4143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4631045", }, ["subjectLabel"] = table#4145 { ["type"] = "literal", ["value"] = "Some approximate fixed point results and application on graph theory for partial (h-F)-generalized convex contraction mappings with special class of functions on complete metric space", ["xml:lang"] = "en", }, }, table#4146 { ["itemType"] = table#4147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4632255", }, ["subjectLabel"] = table#4149 { ["type"] = "literal", ["value"] = "Minimizing algebraic connectivity over graphs made with some given blocks", ["xml:lang"] = "en", }, }, table#4150 { ["itemType"] = table#4151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4633099", }, ["subjectLabel"] = table#4153 { ["type"] = "literal", ["value"] = "Zero-divisor graph of matrix rings and Hurwitz rings", ["xml:lang"] = "en", }, }, table#4154 { ["itemType"] = table#4155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4634467", }, ["subjectLabel"] = table#4157 { ["type"] = "literal", ["value"] = "An Algorithmic Approach to Equitable Total Chromatic Number of Graphs", ["xml:lang"] = "en", }, }, table#4158 { ["itemType"] = table#4159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4634527", }, ["subjectLabel"] = table#4161 { ["type"] = "literal", ["value"] = "Independent domination number in Cayley digraphs of rectangular groups", ["xml:lang"] = "en", }, }, table#4162 { ["itemType"] = table#4163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4634896", }, ["subjectLabel"] = table#4165 { ["type"] = "literal", ["value"] = "Patterns in Khovanov link and chromatic graph homology", ["xml:lang"] = "en", }, }, table#4166 { ["itemType"] = table#4167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4638605", }, ["subjectLabel"] = table#4169 { ["type"] = "literal", ["value"] = "On the non-commuting graph in finite Moufang loops", ["xml:lang"] = "en", }, }, table#4170 { ["itemType"] = table#4171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4639897", }, ["subjectLabel"] = table#4173 { ["type"] = "literal", ["value"] = "Edge Rupture Degree of Graphs", ["xml:lang"] = "en", }, }, table#4174 { ["itemType"] = table#4175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4639901", }, ["subjectLabel"] = table#4177 { ["type"] = "literal", ["value"] = "The Super Spanning Connectivity of Arrangement Graphs", ["xml:lang"] = "en", }, }, table#4178 { ["itemType"] = table#4179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4640108", }, ["subjectLabel"] = table#4181 { ["type"] = "literal", ["value"] = "Spectral properties of Pascal graphs", ["xml:lang"] = "en", }, }, table#4182 { ["itemType"] = table#4183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4645186", }, ["subjectLabel"] = table#4185 { ["type"] = "literal", ["value"] = "Linear time algorithms for dominating pairs in asteroidal triple-free graphs", ["xml:lang"] = "en", }, }, table#4186 { ["itemType"] = table#4187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4645912", }, ["subjectLabel"] = table#4189 { ["type"] = "literal", ["value"] = "Algorithms and extended formulations for one and two facility network design", ["xml:lang"] = "en", }, }, table#4190 { ["itemType"] = table#4191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4648990", }, ["subjectLabel"] = table#4193 { ["type"] = "literal", ["value"] = "A note on the average distance of a Graph", ["xml:lang"] = "en", }, }, table#4194 { ["itemType"] = table#4195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4649001", }, ["subjectLabel"] = table#4197 { ["type"] = "literal", ["value"] = "On cartesian product of vertex measurable graphs", ["xml:lang"] = "en", }, }, table#4198 { ["itemType"] = table#4199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4651725", }, ["subjectLabel"] = table#4201 { ["type"] = "literal", ["value"] = "Single machine parallel batch scheduling subject to precedence constraints", ["xml:lang"] = "en", }, }, table#4202 { ["itemType"] = table#4203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4667717", }, ["subjectLabel"] = table#4205 { ["type"] = "literal", ["value"] = "On the fault-tolerant diameter and wide diameter of ?-connected graphs", ["xml:lang"] = "en", }, }, table#4206 { ["itemType"] = table#4207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4667795", }, ["subjectLabel"] = table#4209 { ["type"] = "literal", ["value"] = "HamiltonianN2-locally connected claw-free graphs", ["xml:lang"] = "en", }, }, table#4210 { ["itemType"] = table#4211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4583539", }, ["subjectLabel"] = table#4213 { ["type"] = "literal", ["value"] = "Classification of rings with toroidal annihilating-ideal graph", ["xml:lang"] = "en", }, }, table#4214 { ["itemType"] = table#4215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4556498", }, ["subjectLabel"] = table#4217 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4556498", }, }, table#4218 { ["itemType"] = table#4219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4682118", }, ["subjectLabel"] = table#4221 { ["type"] = "literal", ["value"] = "On the least eigenvalue of a unicyclic mixed graph", ["xml:lang"] = "en", }, }, table#4222 { ["itemType"] = table#4223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4686442", }, ["subjectLabel"] = table#4225 { ["type"] = "literal", ["value"] = "Quotient and blow-up of automorphisms of graphs of groups", ["xml:lang"] = "en", }, }, table#4226 { ["itemType"] = table#4227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4693340", }, ["subjectLabel"] = table#4229 { ["type"] = "literal", ["value"] = "A degree condition for spanning eulerian subgraphs", ["xml:lang"] = "en", }, }, table#4230 { ["itemType"] = table#4231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4693348", }, ["subjectLabel"] = table#4233 { ["type"] = "literal", ["value"] = "Large P₄‐free graphs with bounded degree", ["xml:lang"] = "en", }, }, table#4234 { ["itemType"] = table#4235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4693354", }, ["subjectLabel"] = table#4237 { ["type"] = "literal", ["value"] = "A characterization of Hamiltonian prisms", ["xml:lang"] = "en", }, }, table#4238 { ["itemType"] = table#4239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4693362", }, ["subjectLabel"] = table#4241 { ["type"] = "literal", ["value"] = "N‐extendability of symmetric graphs", ["xml:lang"] = "en", }, }, table#4242 { ["itemType"] = table#4243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4693363", }, ["subjectLabel"] = table#4245 { ["type"] = "literal", ["value"] = "Supereulerian complementary graphs", ["xml:lang"] = "en", }, }, table#4246 { ["itemType"] = table#4247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4576158", }, ["subjectLabel"] = table#4249 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4576158", }, }, table#4250 { ["itemType"] = table#4251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4578234", }, ["subjectLabel"] = table#4253 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4578234", }, }, table#4254 { ["itemType"] = table#4255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4698080", }, ["subjectLabel"] = table#4257 { ["type"] = "literal", ["value"] = "Path decompositions of multigraphs", ["xml:lang"] = "en", }, }, table#4258 { ["itemType"] = table#4259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4698088", }, ["subjectLabel"] = table#4261 { ["type"] = "literal", ["value"] = "The size of graphs without nowhere‐zero 4‐flows", ["xml:lang"] = "en", }, }, table#4262 { ["itemType"] = table#4263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4698226", }, ["subjectLabel"] = table#4265 { ["type"] = "literal", ["value"] = "Multicommodity flows in simple multistage networks", ["xml:lang"] = "en", }, }, table#4266 { ["itemType"] = table#4267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4698227", }, ["subjectLabel"] = table#4269 { ["type"] = "literal", ["value"] = "Lower bounds for the length of test sequences using UIOs", ["xml:lang"] = "en", }, }, table#4270 { ["itemType"] = table#4271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4617790", }, ["subjectLabel"] = table#4273 { ["type"] = "literal", ["value"] = "On the Eccentric Connectivity Index of Unicyclic Graphs", ["xml:lang"] = "en", }, }, table#4274 { ["itemType"] = table#4275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4583405", }, ["subjectLabel"] = table#4277 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4583405", }, }, table#4278 { ["itemType"] = table#4279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4617562", }, ["subjectLabel"] = table#4281 { ["type"] = "literal", ["value"] = "Complete Forcing Numbers of Polyphenyl Systems", ["xml:lang"] = "en", }, }, table#4282 { ["itemType"] = table#4283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4731203", }, ["subjectLabel"] = table#4285 { ["type"] = "literal", ["value"] = "Maximizing the number of spanning trees of networks based on cycle basis representation", ["xml:lang"] = "en", }, }, table#4286 { ["itemType"] = table#4287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4712248", }, ["subjectLabel"] = table#4289 { ["type"] = "literal", ["value"] = "On the computational complexity of the Jones and Tutte polynomials", ["xml:lang"] = "en", }, }, table#4290 { ["itemType"] = table#4291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4712581", }, ["subjectLabel"] = table#4293 { ["type"] = "literal", ["value"] = "Exposing graph uniformities via algebraic specification", ["xml:lang"] = "en", }, }, table#4294 { ["itemType"] = table#4295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4712978", }, ["subjectLabel"] = table#4297 { ["type"] = "literal", ["value"] = "Disjoint (s, t)‐cuts in a network", ["xml:lang"] = "en", }, }, table#4298 { ["itemType"] = table#4299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4713006", }, ["subjectLabel"] = table#4301 { ["type"] = "literal", ["value"] = "The size of strength‐maximal graphs", ["xml:lang"] = "en", }, }, table#4302 { ["itemType"] = table#4303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4715267", }, ["subjectLabel"] = table#4305 { ["type"] = "literal", ["value"] = "Asymptotic Enumeration of Predicate-Junction Flowgraphs", ["xml:lang"] = "en", }, }, table#4306 { ["itemType"] = table#4307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4715268", }, ["subjectLabel"] = table#4309 { ["type"] = "literal", ["value"] = "A Characterization of Almost-Planar Graphs", ["xml:lang"] = "en", }, }, table#4310 { ["itemType"] = table#4311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4722104", }, ["subjectLabel"] = table#4313 { ["type"] = "literal", ["value"] = "Maximum matchings in a regular graph of specified connectivity and bounded order", ["xml:lang"] = "en", }, }, table#4314 { ["itemType"] = table#4315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4722106", }, ["subjectLabel"] = table#4317 { ["type"] = "literal", ["value"] = "Reflections on graph theory", ["xml:lang"] = "en", }, }, table#4318 { ["itemType"] = table#4319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4729836", }, ["subjectLabel"] = table#4321 { ["type"] = "literal", ["value"] = "A survey: Recent results, conjectures, and open problems in labeling graphs", ["xml:lang"] = "en", }, }, table#4322 { ["itemType"] = table#4323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4731218", }, ["subjectLabel"] = table#4325 { ["type"] = "literal", ["value"] = "Independence number, connectivity, and r‐factors", ["xml:lang"] = "en", }, }, table#4326 { ["itemType"] = table#4327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4613794", }, ["subjectLabel"] = table#4329 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4613794", }, }, table#4330 { ["itemType"] = table#4331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4615393", }, ["subjectLabel"] = table#4333 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4615393", }, }, table#4334 { ["itemType"] = table#4335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4615610", }, ["subjectLabel"] = table#4337 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4615610", }, }, table#4338 { ["itemType"] = table#4339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4615619", }, ["subjectLabel"] = table#4341 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4615619", }, }, table#4342 { ["itemType"] = table#4343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4735012", }, ["subjectLabel"] = table#4345 { ["type"] = "literal", ["value"] = "Directed network reliability: Domination and computing coefficients of the success‐marginal expansion", ["xml:lang"] = "en", }, }, table#4346 { ["itemType"] = table#4347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4621422", }, ["subjectLabel"] = table#4349 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4621422", }, }, table#4350 { ["itemType"] = table#4351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4622634", }, ["subjectLabel"] = table#4353 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4622634", }, }, table#4354 { ["itemType"] = table#4355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4622637", }, ["subjectLabel"] = table#4357 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4622637", }, }, table#4358 { ["itemType"] = table#4359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4744301", }, ["subjectLabel"] = table#4361 { ["type"] = "literal", ["value"] = "A Proof of Tuite’s Trinity Theorem and a New Determinant Formula", ["xml:lang"] = "en", }, }, table#4362 { ["itemType"] = table#4363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4745216", }, ["subjectLabel"] = table#4365 { ["type"] = "literal", ["value"] = "Optimal approximation of sparse hessians and its equivalence to a graph coloring problem", ["xml:lang"] = "en", }, }, table#4366 { ["itemType"] = table#4367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4627509", }, ["subjectLabel"] = table#4369 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4627509", }, }, table#4370 { ["itemType"] = table#4371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4629042", }, ["subjectLabel"] = table#4373 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4629042", }, }, table#4374 { ["itemType"] = table#4375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4764659", }, ["subjectLabel"] = table#4377 { ["type"] = "literal", ["value"] = "On the doyen‐wilson theorem for m‐cycle systems", ["xml:lang"] = "en", }, }, table#4378 { ["itemType"] = table#4379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3159388", }, ["subjectLabel"] = table#4381 { ["type"] = "literal", ["value"] = "Graphs with independent perfect matchings", ["xml:lang"] = "en", }, }, table#4382 { ["itemType"] = table#4383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3442866", }, ["subjectLabel"] = table#4385 { ["type"] = "literal", ["value"] = "Sufficient conditions for graphs to be λ′‐optimal and super‐λ′", ["xml:lang"] = "en", }, }, table#4386 { ["itemType"] = table#4387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3164889", }, ["subjectLabel"] = table#4389 { ["type"] = "literal", ["value"] = "A Lyness equation for graphs", ["xml:lang"] = "en", }, }, table#4390 { ["itemType"] = table#4391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3166733", }, ["subjectLabel"] = table#4393 { ["type"] = "literal", ["value"] = "LIST POINT ARBORICITY OF GRAPHS", ["xml:lang"] = "en", }, }, table#4394 { ["itemType"] = table#4395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3166738", }, ["subjectLabel"] = table#4397 { ["type"] = "literal", ["value"] = "OPTIMIZING DATA THROUGHPUT IN CLIENT/SERVER SYSTEMS BY KEEPING QUEUE SIZES BALANCED", ["xml:lang"] = "en", }, }, table#4398 { ["itemType"] = table#4399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3166741", }, ["subjectLabel"] = table#4401 { ["type"] = "literal", ["value"] = "ON SET-INDEXERS OF PATHS, CYCLES AND CERTAIN RELATED GRAPHS", ["xml:lang"] = "en", }, }, table#4402 { ["itemType"] = table#4403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3167456", }, ["subjectLabel"] = table#4405 { ["type"] = "literal", ["value"] = "A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS", ["xml:lang"] = "en", }, }, table#4406 { ["itemType"] = table#4407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3295105", }, ["subjectLabel"] = table#4409 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3295105", }, }, table#4410 { ["itemType"] = table#4411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3448829", }, ["subjectLabel"] = table#4413 { ["type"] = "literal", ["value"] = "Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time", ["xml:lang"] = "en", }, }, table#4414 { ["itemType"] = table#4415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3449322", }, ["subjectLabel"] = table#4417 { ["type"] = "literal", ["value"] = "Low Rank Tensor Manifold Learning", ["xml:lang"] = "en", }, }, table#4418 { ["itemType"] = table#4419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3173943", }, ["subjectLabel"] = table#4421 { ["type"] = "literal", ["value"] = "VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS", ["xml:lang"] = "en", }, }, table#4422 { ["itemType"] = table#4423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3173947", }, ["subjectLabel"] = table#4425 { ["type"] = "literal", ["value"] = "RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS", ["xml:lang"] = "en", }, }, table#4426 { ["itemType"] = table#4427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3300703", }, ["subjectLabel"] = table#4429 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3300703", }, }, table#4430 { ["itemType"] = table#4431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3176173", }, ["subjectLabel"] = table#4433 { ["type"] = "literal", ["value"] = "Vertex disjoint cycles in intersection graphs of bases of matroids", ["xml:lang"] = "en", }, }, table#4434 { ["itemType"] = table#4435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3466338", }, ["subjectLabel"] = table#4437 { ["type"] = "literal", ["value"] = "Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings", ["xml:lang"] = "en", }, }, table#4438 { ["itemType"] = table#4439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3470480", }, ["subjectLabel"] = table#4441 { ["type"] = "literal", ["value"] = "Regular graphs with prescribed chromatic number", ["xml:lang"] = "en", }, }, table#4442 { ["itemType"] = table#4443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3470497", }, ["subjectLabel"] = table#4445 { ["type"] = "literal", ["value"] = "Spectral Radius and Degree Sequence", ["xml:lang"] = "en", }, }, table#4446 { ["itemType"] = table#4447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3197855", }, ["subjectLabel"] = table#4449 { ["type"] = "literal", ["value"] = "Double cycle covers and the petersen graph", ["xml:lang"] = "en", }, }, table#4450 { ["itemType"] = table#4451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3197962", }, ["subjectLabel"] = table#4453 { ["type"] = "literal", ["value"] = "On the product of all nonzero elements of a finite ring", ["xml:lang"] = "en", }, }, table#4454 { ["itemType"] = table#4455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3475297", }, ["subjectLabel"] = table#4457 { ["type"] = "literal", ["value"] = "Three tree-paths", ["xml:lang"] = "en", }, }, table#4458 { ["itemType"] = table#4459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3476832", }, ["subjectLabel"] = table#4461 { ["type"] = "literal", ["value"] = "Is every cycle basis fundamental?", ["xml:lang"] = "en", }, }, table#4462 { ["itemType"] = table#4463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3476835", }, ["subjectLabel"] = table#4465 { ["type"] = "literal", ["value"] = "Reduced graphs of diameter two", ["xml:lang"] = "en", }, }, table#4466 { ["itemType"] = table#4467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3477956", }, ["subjectLabel"] = table#4469 { ["type"] = "literal", ["value"] = "Ranking intervals under visibility constraints^∗", ["xml:lang"] = "en", }, }, table#4470 { ["itemType"] = table#4471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3204507", }, ["subjectLabel"] = table#4473 { ["type"] = "literal", ["value"] = "An Analogue of the Shannon Capacity of a Graph", ["xml:lang"] = "en", }, }, table#4474 { ["itemType"] = table#4475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3480080", }, ["subjectLabel"] = table#4477 { ["type"] = "literal", ["value"] = "A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian", ["xml:lang"] = "en", }, }, table#4478 { ["itemType"] = table#4479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3206989", }, ["subjectLabel"] = table#4481 { ["type"] = "literal", ["value"] = "Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs", ["xml:lang"] = "en", }, }, table#4482 { ["itemType"] = table#4483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3481724", }, ["subjectLabel"] = table#4485 { ["type"] = "literal", ["value"] = "Locally semicomplete digraphs: A generalization of tournaments", ["xml:lang"] = "en", }, }, table#4486 { ["itemType"] = table#4487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3481736", }, ["subjectLabel"] = table#4489 { ["type"] = "literal", ["value"] = "The 2-hamiltonian cubes of graphs", ["xml:lang"] = "en", }, }, table#4490 { ["itemType"] = table#4491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3483304", }, ["subjectLabel"] = table#4493 { ["type"] = "literal", ["value"] = "On the construction of odd cycle systems", ["xml:lang"] = "en", }, }, table#4494 { ["itemType"] = table#4495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3483309", }, ["subjectLabel"] = table#4497 { ["type"] = "literal", ["value"] = "The ally-reconstruction number of a tree with five or more vertices is three", ["xml:lang"] = "en", }, }, table#4498 { ["itemType"] = table#4499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3490012", }, ["subjectLabel"] = table#4501 { ["type"] = "literal", ["value"] = "On the equality of the grundy and ochromatic numbers of a graph", ["xml:lang"] = "en", }, }, table#4502 { ["itemType"] = table#4503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503105", }, ["subjectLabel"] = table#4505 { ["type"] = "literal", ["value"] = "A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS", ["xml:lang"] = "en", }, }, table#4506 { ["itemType"] = table#4507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503468", }, ["subjectLabel"] = table#4509 { ["type"] = "literal", ["value"] = "On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints", ["xml:lang"] = "en", }, }, table#4510 { ["itemType"] = table#4511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503551", }, ["subjectLabel"] = table#4513 { ["type"] = "literal", ["value"] = "Clique-coloring UE and UEH graphs", ["xml:lang"] = "en", }, }, table#4514 { ["itemType"] = table#4515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503552", }, ["subjectLabel"] = table#4517 { ["type"] = "literal", ["value"] = "On a Conjecture of Víctor Neumann-Lara", ["xml:lang"] = "en", }, }, table#4518 { ["itemType"] = table#4519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503635", }, ["subjectLabel"] = table#4521 { ["type"] = "literal", ["value"] = "Comparing Universal Covers in Polynomial Time", ["xml:lang"] = "en", }, }, table#4522 { ["itemType"] = table#4523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3506251", }, ["subjectLabel"] = table#4525 { ["type"] = "literal", ["value"] = "Vertex-neighbour-integrity of composition graphs of paths and cycles", ["xml:lang"] = "en", }, }, table#4526 { ["itemType"] = table#4527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3506318", }, ["subjectLabel"] = table#4529 { ["type"] = "literal", ["value"] = "Cycles passing throughk + 1 vertices ink-connected graphs", ["xml:lang"] = "en", }, }, table#4530 { ["itemType"] = table#4531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3507647", }, ["subjectLabel"] = table#4533 { ["type"] = "literal", ["value"] = "w -Rabin numbers and strong w -Rabin numbers of folded hypercubes", ["xml:lang"] = "en", }, }, table#4534 { ["itemType"] = table#4535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3391323", }, ["subjectLabel"] = table#4537 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3391323", }, }, table#4538 { ["itemType"] = table#4539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3391327", }, ["subjectLabel"] = table#4541 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3391327", }, }, table#4542 { ["itemType"] = table#4543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3295009", }, ["subjectLabel"] = table#4545 { ["type"] = "literal", ["value"] = "Rainbow neighbourhood number of graphs", ["xml:lang"] = "en", }, }, table#4546 { ["itemType"] = table#4547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3295234", }, ["subjectLabel"] = table#4549 { ["type"] = "literal", ["value"] = "Star edge coloring of corona product of path and wheel graph families", ["xml:lang"] = "en", }, }, table#4550 { ["itemType"] = table#4551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3298118", }, ["subjectLabel"] = table#4553 { ["type"] = "literal", ["value"] = "4-edge-connected 4-regular maps on the projective plane", ["xml:lang"] = "en", }, }, table#4554 { ["itemType"] = table#4555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3301260", }, ["subjectLabel"] = table#4557 { ["type"] = "literal", ["value"] = "On the location of zeros of the Homfly polynomial", ["xml:lang"] = "en", }, }, table#4558 { ["itemType"] = table#4559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3301692", }, ["subjectLabel"] = table#4561 { ["type"] = "literal", ["value"] = "Enumeration of spanning trees on Apollonian networks", ["xml:lang"] = "en", }, }, table#4562 { ["itemType"] = table#4563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3301965", }, ["subjectLabel"] = table#4565 { ["type"] = "literal", ["value"] = "A note on ‘some physical and chemical indices of clique-inserted lattices’", ["xml:lang"] = "en", }, }, table#4566 { ["itemType"] = table#4567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3302166", }, ["subjectLabel"] = table#4569 { ["type"] = "literal", ["value"] = "Research on solution space of bipartite graph vertex-cover by maximum matchings", ["xml:lang"] = "en", }, }, table#4570 { ["itemType"] = table#4571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3303374", }, ["subjectLabel"] = table#4573 { ["type"] = "literal", ["value"] = "Core influence mechanism on vertex-cover problem through leaf-removal-core breaking", ["xml:lang"] = "en", }, }, table#4574 { ["itemType"] = table#4575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3311677", }, ["subjectLabel"] = table#4577 { ["type"] = "literal", ["value"] = "Steiner trees, partial 2–trees, and minimum IFI networks", ["xml:lang"] = "en", }, }, table#4578 { ["itemType"] = table#4579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3313894", }, ["subjectLabel"] = table#4581 { ["type"] = "literal", ["value"] = "Cyclability of r-regular r-connected graphs", ["xml:lang"] = "en", }, }, table#4582 { ["itemType"] = table#4583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3318805", }, ["subjectLabel"] = table#4585 { ["type"] = "literal", ["value"] = "On hamiltonian line graphs", ["xml:lang"] = "en", }, }, table#4586 { ["itemType"] = table#4587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3119721", }, ["subjectLabel"] = table#4589 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3119721", }, }, table#4590 { ["itemType"] = table#4591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3333060", }, ["subjectLabel"] = table#4593 { ["type"] = "literal", ["value"] = "Tutte's 5-flow conjecture for the projective plane", ["xml:lang"] = "en", }, }, table#4594 { ["itemType"] = table#4595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3333080", }, ["subjectLabel"] = table#4597 { ["type"] = "literal", ["value"] = "ON α,β DESTRUCTIBLE GRAPHS", ["xml:lang"] = "en", }, }, table#4598 { ["itemType"] = table#4599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3333722", }, ["subjectLabel"] = table#4601 { ["type"] = "literal", ["value"] = "Strong shift equivalence of 2 × 2 matrices of non-negative integers", ["xml:lang"] = "en", }, }, table#4602 { ["itemType"] = table#4603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3335811", }, ["subjectLabel"] = table#4605 { ["type"] = "literal", ["value"] = "Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs", ["xml:lang"] = "en", }, }, table#4606 { ["itemType"] = table#4607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3342378", }, ["subjectLabel"] = table#4609 { ["type"] = "literal", ["value"] = "Network reliability and acyclic orientations", ["xml:lang"] = "en", }, }, table#4610 { ["itemType"] = table#4611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3342614", }, ["subjectLabel"] = table#4613 { ["type"] = "literal", ["value"] = "Circulants and their connectivities", ["xml:lang"] = "en", }, }, table#4614 { ["itemType"] = table#4615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3352500", }, ["subjectLabel"] = table#4617 { ["type"] = "literal", ["value"] = "Some sequential graph colouring algorithms", ["xml:lang"] = "en", }, }, table#4618 { ["itemType"] = table#4619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3353048", }, ["subjectLabel"] = table#4621 { ["type"] = "literal", ["value"] = "Long dominating cycles and paths in graphs with large neighborhood unions", ["xml:lang"] = "en", }, }, table#4622 { ["itemType"] = table#4623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3353054", }, ["subjectLabel"] = table#4625 { ["type"] = "literal", ["value"] = "Minimum cycle coverings and integer flows", ["xml:lang"] = "en", }, }, table#4626 { ["itemType"] = table#4627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3366636", }, ["subjectLabel"] = table#4629 { ["type"] = "literal", ["value"] = "On Harpers' Result Concerning the Bandwidths of Graphs", ["xml:lang"] = "en", }, }, table#4630 { ["itemType"] = table#4631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3366678", }, ["subjectLabel"] = table#4633 { ["type"] = "literal", ["value"] = "On the Minus Domination Number of Graphs", ["xml:lang"] = "en", }, }, table#4634 { ["itemType"] = table#4635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3368139", }, ["subjectLabel"] = table#4637 { ["type"] = "literal", ["value"] = "A note on vulnerability in graphs of diameter five(II)", ["xml:lang"] = "en", }, }, table#4638 { ["itemType"] = table#4639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3376696", }, ["subjectLabel"] = table#4641 { ["type"] = "literal", ["value"] = "A note on the cover degeneracy of graphs", ["xml:lang"] = "en", }, }, table#4642 { ["itemType"] = table#4643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3390052", }, ["subjectLabel"] = table#4645 { ["type"] = "literal", ["value"] = "Wiener-type indices of Parikh word representable graphs", ["xml:lang"] = "en", }, }, table#4646 { ["itemType"] = table#4647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3397518", }, ["subjectLabel"] = table#4649 { ["type"] = "literal", ["value"] = "ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS", ["xml:lang"] = "en", }, }, table#4650 { ["itemType"] = table#4651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3400290", }, ["subjectLabel"] = table#4653 { ["type"] = "literal", ["value"] = "Perfect matching dominating cycle — a new dominating cycle", ["xml:lang"] = "en", }, }, table#4654 { ["itemType"] = table#4655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3103648", }, ["subjectLabel"] = table#4657 { ["type"] = "literal", ["value"] = "ON THE COMMUTING GRAPH OF RINGS", ["xml:lang"] = "en", }, }, table#4658 { ["itemType"] = table#4659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3404458", }, ["subjectLabel"] = table#4661 { ["type"] = "literal", ["value"] = "Graphs and Algorithms in Communication Networks on Seven League Boots", ["xml:lang"] = "en", }, }, table#4662 { ["itemType"] = table#4663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3106266", }, ["subjectLabel"] = table#4665 { ["type"] = "literal", ["value"] = "Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs", ["xml:lang"] = "en", }, }, table#4666 { ["itemType"] = table#4667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3415878", }, ["subjectLabel"] = table#4669 { ["type"] = "literal", ["value"] = "Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching", ["xml:lang"] = "en", }, }, table#4670 { ["itemType"] = table#4671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3415880", }, ["subjectLabel"] = table#4673 { ["type"] = "literal", ["value"] = "Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing", ["xml:lang"] = "en", }, }, table#4674 { ["itemType"] = table#4675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3115766", }, ["subjectLabel"] = table#4677 { ["type"] = "literal", ["value"] = "BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS", ["xml:lang"] = "en", }, }, table#4678 { ["itemType"] = table#4679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3115777", }, ["subjectLabel"] = table#4681 { ["type"] = "literal", ["value"] = "ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS", ["xml:lang"] = "en", }, }, table#4682 { ["itemType"] = table#4683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3418127", }, ["subjectLabel"] = table#4685 { ["type"] = "literal", ["value"] = "The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut", ["xml:lang"] = "en", }, }, table#4686 { ["itemType"] = table#4687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3419703", }, ["subjectLabel"] = table#4689 { ["type"] = "literal", ["value"] = "Hamiltonian graphs involving neighborhood unions", ["xml:lang"] = "en", }, }, table#4690 { ["itemType"] = table#4691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3421564", }, ["subjectLabel"] = table#4693 { ["type"] = "literal", ["value"] = "BOUNDING DISKS TO A SPATIAL GRAPH", ["xml:lang"] = "en", }, }, table#4694 { ["itemType"] = table#4695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3127254", }, ["subjectLabel"] = table#4697 { ["type"] = "literal", ["value"] = "Disjoint paths, planarizing cycles, and spanning walks", ["xml:lang"] = "en", }, }, table#4698 { ["itemType"] = table#4699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3428909", }, ["subjectLabel"] = table#4701 { ["type"] = "literal", ["value"] = "Integer programming formulations for the two 4-hop-constrained paths problem", ["xml:lang"] = "en", }, }, table#4702 { ["itemType"] = table#4703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3429757", }, ["subjectLabel"] = table#4705 { ["type"] = "literal", ["value"] = "Factors of Inserted Graphs", ["xml:lang"] = "en", }, }, table#4706 { ["itemType"] = table#4707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3430309", }, ["subjectLabel"] = table#4709 { ["type"] = "literal", ["value"] = "A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS", ["xml:lang"] = "en", }, }, table#4710 { ["itemType"] = table#4711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3437004", }, ["subjectLabel"] = table#4713 { ["type"] = "literal", ["value"] = "Nowhere-zero flows in tensor product of graphs", ["xml:lang"] = "en", }, }, table#4714 { ["itemType"] = table#4715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3437354", }, ["subjectLabel"] = table#4717 { ["type"] = "literal", ["value"] = "Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks", ["xml:lang"] = "en", }, }, table#4718 { ["itemType"] = table#4719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3137765", }, ["subjectLabel"] = table#4721 { ["type"] = "literal", ["value"] = "The complete closure of a graph", ["xml:lang"] = "en", }, }, table#4722 { ["itemType"] = table#4723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3438781", }, ["subjectLabel"] = table#4725 { ["type"] = "literal", ["value"] = "Relationships between rupture degree and other parameters", ["xml:lang"] = "en", }, }, table#4726 { ["itemType"] = table#4727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439088", }, ["subjectLabel"] = table#4729 { ["type"] = "literal", ["value"] = "Characterization of Graphs G for which", ["xml:lang"] = "en", }, }, table#4730 { ["itemType"] = table#4731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439170", }, ["subjectLabel"] = table#4733 { ["type"] = "literal", ["value"] = "Heavy cycles in k-connected weighted graphs", ["xml:lang"] = "en", }, }, table#4734 { ["itemType"] = table#4735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439307", }, ["subjectLabel"] = table#4737 { ["type"] = "literal", ["value"] = "The maximal restricted edge connectivity of Kautz undirected graphs", ["xml:lang"] = "en", }, }, table#4738 { ["itemType"] = table#4739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439314", }, ["subjectLabel"] = table#4741 { ["type"] = "literal", ["value"] = "Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs", ["xml:lang"] = "en", }, }, table#4742 { ["itemType"] = table#4743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439353", }, ["subjectLabel"] = table#4745 { ["type"] = "literal", ["value"] = "Degree Conditions and Degree Bounded Trees", ["xml:lang"] = "en", }, }, table#4746 { ["itemType"] = table#4747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439413", }, ["subjectLabel"] = table#4749 { ["type"] = "literal", ["value"] = "Hamiltonicity and pancyclicity of generalized prisms", ["xml:lang"] = "en", }, }, table#4750 { ["itemType"] = table#4751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439419", }, ["subjectLabel"] = table#4753 { ["type"] = "literal", ["value"] = "The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs", ["xml:lang"] = "en", }, }, table#4754 { ["itemType"] = table#4755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439565", }, ["subjectLabel"] = table#4757 { ["type"] = "literal", ["value"] = "Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks", ["xml:lang"] = "en", }, }, table#4758 { ["itemType"] = table#4759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439577", }, ["subjectLabel"] = table#4761 { ["type"] = "literal", ["value"] = "Infinite families of -dichromatic vertex critical circulant tournaments", ["xml:lang"] = "en", }, }, table#4762 { ["itemType"] = table#4763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3439859", }, ["subjectLabel"] = table#4765 { ["type"] = "literal", ["value"] = "Generalized matching networks and their properties", ["xml:lang"] = "en", }, }, table#4766 { ["itemType"] = table#4767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3144369", }, ["subjectLabel"] = table#4769 { ["type"] = "literal", ["value"] = "PLANAR, OUTERPLANAR, AND RING GRAPH OF THE COZERO-DIVISOR GRAPH OF A FINITE COMMUTATIVE RING", ["xml:lang"] = "en", }, }, table#4770 { ["itemType"] = table#4771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3300699", }, ["subjectLabel"] = table#4773 { ["type"] = "literal", ["value"] = "On the number of reachable pairs in a digraph", ["xml:lang"] = "en", }, }, table#4774 { ["itemType"] = table#4775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3150192", }, ["subjectLabel"] = table#4777 { ["type"] = "literal", ["value"] = "Circular flows of nearly Eulerian graphs and vertex-splitting", ["xml:lang"] = "en", }, }, table#4778 { ["itemType"] = table#4779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1637157", }, ["subjectLabel"] = table#4781 { ["type"] = "literal", ["value"] = "Unimodality of independence polynomials of the incidence product of graphs", ["xml:lang"] = "en", }, }, table#4782 { ["itemType"] = table#4783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1645058", }, ["subjectLabel"] = table#4785 { ["type"] = "literal", ["value"] = "Ramsey-nice families of graphs", ["xml:lang"] = "en", }, }, table#4786 { ["itemType"] = table#4787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1647836", }, ["subjectLabel"] = table#4789 { ["type"] = "literal", ["value"] = "Solving the tree containment problem in linear time for nearly stable phylogenetic networks", ["xml:lang"] = "en", }, }, table#4790 { ["itemType"] = table#4791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1647839", }, ["subjectLabel"] = table#4793 { ["type"] = "literal", ["value"] = "The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs", ["xml:lang"] = "en", }, }, table#4794 { ["itemType"] = table#4795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1649100", }, ["subjectLabel"] = table#4797 { ["type"] = "literal", ["value"] = "Computation of topological indices of some special graphs", ["xml:lang"] = "en", }, }, table#4798 { ["itemType"] = table#4799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1649131", }, ["subjectLabel"] = table#4801 { ["type"] = "literal", ["value"] = "g-convex weight sequences", ["xml:lang"] = "en", }, }, table#4802 { ["itemType"] = table#4803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1649917", }, ["subjectLabel"] = table#4805 { ["type"] = "literal", ["value"] = "Equitable coloring and equitable choosability of graphs with small maximum average degree", ["xml:lang"] = "en", }, }, table#4806 { ["itemType"] = table#4807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1650670", }, ["subjectLabel"] = table#4809 { ["type"] = "literal", ["value"] = "Distributing pairs of vertices on Hamiltonian cycles", ["xml:lang"] = "en", }, }, table#4810 { ["itemType"] = table#4811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1651413", }, ["subjectLabel"] = table#4813 { ["type"] = "literal", ["value"] = "A stable enriched Galerkin element for the Stokes problem", ["xml:lang"] = "en", }, }, table#4814 { ["itemType"] = table#4815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1653021", }, ["subjectLabel"] = table#4817 { ["type"] = "literal", ["value"] = "Degree sum conditions on two disjoint cycles in graphs", ["xml:lang"] = "en", }, }, table#4818 { ["itemType"] = table#4819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1656906", }, ["subjectLabel"] = table#4821 { ["type"] = "literal", ["value"] = "The crossing numbers of join of some graphs with \$n\$ isolated vertices", ["xml:lang"] = "en", }, }, table#4822 { ["itemType"] = table#4823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1656911", }, ["subjectLabel"] = table#4825 { ["type"] = "literal", ["value"] = "Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles", ["xml:lang"] = "en", }, }, table#4826 { ["itemType"] = table#4827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1660300", }, ["subjectLabel"] = table#4829 { ["type"] = "literal", ["value"] = "The \$g\$-good-neighbor conditional diagnosability of locally twisted cubes", ["xml:lang"] = "en", }, }, table#4830 { ["itemType"] = table#4831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1661501", }, ["subjectLabel"] = table#4833 { ["type"] = "literal", ["value"] = "An upper bound on the number of edges of a graph whose \$k\$th power has a connected complement", ["xml:lang"] = "en", }, }, table#4834 { ["itemType"] = table#4835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1665942", }, ["subjectLabel"] = table#4837 { ["type"] = "literal", ["value"] = "The spectral radius for a class of double-star-like tree systems with maximal degree 4", ["xml:lang"] = "en", }, }, table#4838 { ["itemType"] = table#4839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1671302", }, ["subjectLabel"] = table#4841 { ["type"] = "literal", ["value"] = "Modulo orientations with bounded independence number", ["xml:lang"] = "en", }, }, table#4842 { ["itemType"] = table#4843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1671649", }, ["subjectLabel"] = table#4845 { ["type"] = "literal", ["value"] = "Cubic edge-transitive bi-\$p\$-metacirculants", ["xml:lang"] = "en", }, }, table#4846 { ["itemType"] = table#4847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1676885", }, ["subjectLabel"] = table#4849 { ["type"] = "literal", ["value"] = "2D tree object representation via the slope chain code", ["xml:lang"] = "en", }, }, table#4850 { ["itemType"] = table#4851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1679510", }, ["subjectLabel"] = table#4853 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total coloring of planar graphs without 4-cycles", ["xml:lang"] = "en", }, }, table#4854 { ["itemType"] = table#4855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1679523", }, ["subjectLabel"] = table#4857 { ["type"] = "literal", ["value"] = "2-distance coloring of planar graphs with girth 5", ["xml:lang"] = "en", }, }, table#4858 { ["itemType"] = table#4859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1680298", }, ["subjectLabel"] = table#4861 { ["type"] = "literal", ["value"] = "The rank of a signed graph in terms of the rank of its underlying graph", ["xml:lang"] = "en", }, }, table#4862 { ["itemType"] = table#4863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1680497", }, ["subjectLabel"] = table#4865 { ["type"] = "literal", ["value"] = "Nordhaus-Gaddum type result for the matching number of a graph", ["xml:lang"] = "en", }, }, table#4866 { ["itemType"] = table#4867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1680535", }, ["subjectLabel"] = table#4869 { ["type"] = "literal", ["value"] = "On \$g\$-extra conditional diagnosability of hypercubes and folded hypercubes", ["xml:lang"] = "en", }, }, table#4870 { ["itemType"] = table#4871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1682785", }, ["subjectLabel"] = table#4873 { ["type"] = "literal", ["value"] = "Newton flows for elliptic functions. II: Structural stability: classification and representation", ["xml:lang"] = "en", }, }, table#4874 { ["itemType"] = table#4875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1685964", }, ["subjectLabel"] = table#4877 { ["type"] = "literal", ["value"] = "Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes", ["xml:lang"] = "en", }, }, table#4878 { ["itemType"] = table#4879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1685973", }, ["subjectLabel"] = table#4881 { ["type"] = "literal", ["value"] = "Reliability analysis of twisted cubes", ["xml:lang"] = "en", }, }, table#4882 { ["itemType"] = table#4883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1686004", }, ["subjectLabel"] = table#4885 { ["type"] = "literal", ["value"] = "Turán numbers of vertex-disjoint cliques in \$r\$-partite graphs", ["xml:lang"] = "en", }, }, table#4886 { ["itemType"] = table#4887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1686009", }, ["subjectLabel"] = table#4889 { ["type"] = "literal", ["value"] = "Every signed planar graph without cycles of length from 4 to 8 is 3-colorable", ["xml:lang"] = "en", }, }, table#4890 { ["itemType"] = table#4891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1686071", }, ["subjectLabel"] = table#4893 { ["type"] = "literal", ["value"] = "An iteration method for computing the total number of spanning trees and its applications in graph theory", ["xml:lang"] = "en", }, }, table#4894 { ["itemType"] = table#4895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1688129", }, ["subjectLabel"] = table#4897 { ["type"] = "literal", ["value"] = "Monitoring effective connectivity in the preterm brain: a graph approach to study maturation", ["xml:lang"] = "en", }, }, table#4898 { ["itemType"] = table#4899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1688270", }, ["subjectLabel"] = table#4901 { ["type"] = "literal", ["value"] = "Spanning quadrangulations of triangulated surfaces", ["xml:lang"] = "en", }, }, table#4902 { ["itemType"] = table#4903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1689055", }, ["subjectLabel"] = table#4905 { ["type"] = "literal", ["value"] = "On weakly symmetric graphs of order twice a prime square", ["xml:lang"] = "en", }, }, table#4906 { ["itemType"] = table#4907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1690578", }, ["subjectLabel"] = table#4909 { ["type"] = "literal", ["value"] = "2-connected factor-critical graphs \$G\$ with exactly \$|E(G)| + 1\$ maximum matchings", ["xml:lang"] = "en", }, }, table#4910 { ["itemType"] = table#4911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1692644", }, ["subjectLabel"] = table#4913 { ["type"] = "literal", ["value"] = "Matchings extend to Hamiltonian cycles in 5-cube", ["xml:lang"] = "en", }, }, table#4914 { ["itemType"] = table#4915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1693170", }, ["subjectLabel"] = table#4917 { ["type"] = "literal", ["value"] = "Hamiltonian laceability in hypercubes with faulty edges", ["xml:lang"] = "en", }, }, table#4918 { ["itemType"] = table#4919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1694726", }, ["subjectLabel"] = table#4921 { ["type"] = "literal", ["value"] = "One-to-one disjoint path covers in digraphs", ["xml:lang"] = "en", }, }, table#4922 { ["itemType"] = table#4923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1697645", }, ["subjectLabel"] = table#4925 { ["type"] = "literal", ["value"] = "Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains", ["xml:lang"] = "en", }, }, table#4926 { ["itemType"] = table#4927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1698052", }, ["subjectLabel"] = table#4929 { ["type"] = "literal", ["value"] = "The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven", ["xml:lang"] = "en", }, }, table#4930 { ["itemType"] = table#4931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1699544", }, ["subjectLabel"] = table#4933 { ["type"] = "literal", ["value"] = "Characterization of the induced matching extendable graphs with \$2 n\$ vertices and \$3 n\$ edges", ["xml:lang"] = "en", }, }, table#4934 { ["itemType"] = table#4935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1702451", }, ["subjectLabel"] = table#4937 { ["type"] = "literal", ["value"] = "On \$K_{p,q}\$-factorization of complete bipartite multigraphs", ["xml:lang"] = "en", }, }, table#4938 { ["itemType"] = table#4939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1702821", }, ["subjectLabel"] = table#4941 { ["type"] = "literal", ["value"] = "On vertex-parity edge-colorings", ["xml:lang"] = "en", }, }, table#4942 { ["itemType"] = table#4943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1706118", }, ["subjectLabel"] = table#4945 { ["type"] = "literal", ["value"] = "Bigraphic pairs with an \$A\$-connected realization", ["xml:lang"] = "en", }, }, table#4946 { ["itemType"] = table#4947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1706133", }, ["subjectLabel"] = table#4949 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total coloring of sparse IC-planar graphs", ["xml:lang"] = "en", }, }, table#4950 { ["itemType"] = table#4951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1707969", }, ["subjectLabel"] = table#4953 { ["type"] = "literal", ["value"] = "An implicit degree condition for \$k\$-connected 2-heavy graphs to be Hamiltonian", ["xml:lang"] = "en", }, }, table#4954 { ["itemType"] = table#4955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1707977", }, ["subjectLabel"] = table#4957 { ["type"] = "literal", ["value"] = "Some results on the inverse sum indeg index of a graph", ["xml:lang"] = "en", }, }, table#4958 { ["itemType"] = table#4959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1707984", }, ["subjectLabel"] = table#4961 { ["type"] = "literal", ["value"] = "On \$f\$-colorings of nearly bipartite graphs", ["xml:lang"] = "en", }, }, table#4962 { ["itemType"] = table#4963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1708383", }, ["subjectLabel"] = table#4965 { ["type"] = "literal", ["value"] = "The crossing number of join of the generalized Petersen graph \$P(3, 1)\$ with path and cycle", ["xml:lang"] = "en", }, }, table#4966 { ["itemType"] = table#4967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1708402", }, ["subjectLabel"] = table#4969 { ["type"] = "literal", ["value"] = "Total domination versus paired-domination in regular graphs", ["xml:lang"] = "en", }, }, table#4970 { ["itemType"] = table#4971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1709430", }, ["subjectLabel"] = table#4973 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz", ["xml:lang"] = "en", }, }, table#4974 { ["itemType"] = table#4975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1709519", }, ["subjectLabel"] = table#4977 { ["type"] = "literal", ["value"] = "List \$r\$-hued chromatic number of graphs with bounded maximum average degrees", ["xml:lang"] = "en", }, }, table#4978 { ["itemType"] = table#4979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1709539", }, ["subjectLabel"] = table#4981 { ["type"] = "literal", ["value"] = "Degree sum and Hamiltonian-connected line graphs", ["xml:lang"] = "en", }, }, table#4982 { ["itemType"] = table#4983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1711417", }, ["subjectLabel"] = table#4985 { ["type"] = "literal", ["value"] = "A degree condition for fractional \$[a,b]\$-covered graphs", ["xml:lang"] = "en", }, }, table#4986 { ["itemType"] = table#4987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1712789", }, ["subjectLabel"] = table#4989 { ["type"] = "literal", ["value"] = "Nordhaus-Gaddum-type theorem for total-proper connection number of graphs", ["xml:lang"] = "en", }, }, table#4990 { ["itemType"] = table#4991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1713295", }, ["subjectLabel"] = table#4993 { ["type"] = "literal", ["value"] = "The \$A_{\\alpha}\$ spectral radius characterization of some digraphs", ["xml:lang"] = "en", }, }, table#4994 { ["itemType"] = table#4995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1713403", }, ["subjectLabel"] = table#4997 { ["type"] = "literal", ["value"] = "Hybrid fault diagnosis capability analysis of regular graphs", ["xml:lang"] = "en", }, }, table#4998 { ["itemType"] = table#4999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1713576", }, ["subjectLabel"] = table#5001 { ["type"] = "literal", ["value"] = "Some results on the independence number of connected domination critical graphs", ["xml:lang"] = "en", }, }, table#5002 { ["itemType"] = table#5003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1713616", }, ["subjectLabel"] = table#5005 { ["type"] = "literal", ["value"] = "The adjacency spectrum of two new operations of graphs", ["xml:lang"] = "en", }, }, table#5006 { ["itemType"] = table#5007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1714012", }, ["subjectLabel"] = table#5009 { ["type"] = "literal", ["value"] = "Nowhere-zero flows on signed wheels and signed fans", ["xml:lang"] = "en", }, }, table#5010 { ["itemType"] = table#5011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1715848", }, ["subjectLabel"] = table#5013 { ["type"] = "literal", ["value"] = "A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph", ["xml:lang"] = "en", }, }, table#5014 { ["itemType"] = table#5015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1716488", }, ["subjectLabel"] = table#5017 { ["type"] = "literal", ["value"] = "The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices", ["xml:lang"] = "en", }, }, table#5018 { ["itemType"] = table#5019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1717181", }, ["subjectLabel"] = table#5021 { ["type"] = "literal", ["value"] = "On edge colorings of 1-planar graphs without 5-cycles with two chords", ["xml:lang"] = "en", }, }, table#5022 { ["itemType"] = table#5023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1717189", }, ["subjectLabel"] = table#5025 { ["type"] = "literal", ["value"] = "Edge-connectivity and edges of even factors of graphs", ["xml:lang"] = "en", }, }, table#5026 { ["itemType"] = table#5027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1720337", }, ["subjectLabel"] = table#5029 { ["type"] = "literal", ["value"] = "On the geometric-arithmetic index of a graph", ["xml:lang"] = "en", }, }, table#5030 { ["itemType"] = table#5031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1720343", }, ["subjectLabel"] = table#5033 { ["type"] = "literal", ["value"] = "The Turán number for spanning linear forests", ["xml:lang"] = "en", }, }, table#5034 { ["itemType"] = table#5035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1720992", }, ["subjectLabel"] = table#5037 { ["type"] = "literal", ["value"] = "High-order degree and combined degree in complex networks", ["xml:lang"] = "en", }, }, table#5038 { ["itemType"] = table#5039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1723356", }, ["subjectLabel"] = table#5041 { ["type"] = "literal", ["value"] = "Spanning 3-ended trees in almost claw-free graphs", ["xml:lang"] = "en", }, }, table#5042 { ["itemType"] = table#5043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1727082", }, ["subjectLabel"] = table#5045 { ["type"] = "literal", ["value"] = "The Harary index of all unicyclic graphs with given diameter", ["xml:lang"] = "en", }, }, table#5046 { ["itemType"] = table#5047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1727162", }, ["subjectLabel"] = table#5049 { ["type"] = "literal", ["value"] = "The general (\$\\alpha, 3\$)-path connectivity indices of polycyclic aromatic hydrocarbons", ["xml:lang"] = "en", }, }, table#5050 { ["itemType"] = table#5051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1727252", }, ["subjectLabel"] = table#5053 { ["type"] = "literal", ["value"] = "The edge connectivity of expanded \$k\$-ary \$n\$-cubes", ["xml:lang"] = "en", }, }, table#5054 { ["itemType"] = table#5055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1727289", }, ["subjectLabel"] = table#5057 { ["type"] = "literal", ["value"] = "Characterizations of certain types of type 2 soft graphs", ["xml:lang"] = "en", }, }, table#5058 { ["itemType"] = table#5059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1730267", }, ["subjectLabel"] = table#5061 { ["type"] = "literal", ["value"] = "Conditional connectivity of folded hypercubes", ["xml:lang"] = "en", }, }, table#5062 { ["itemType"] = table#5063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1732091", }, ["subjectLabel"] = table#5065 { ["type"] = "literal", ["value"] = "Reciprocal degree distance and graph properties", ["xml:lang"] = "en", }, }, table#5066 { ["itemType"] = table#5067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1732095", }, ["subjectLabel"] = table#5069 { ["type"] = "literal", ["value"] = "The zero forcing polynomial of a graph", ["xml:lang"] = "en", }, }, table#5070 { ["itemType"] = table#5071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1732107", }, ["subjectLabel"] = table#5073 { ["type"] = "literal", ["value"] = "On the peripheral Wiener index of graphs", ["xml:lang"] = "en", }, }, table#5074 { ["itemType"] = table#5075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1732823", }, ["subjectLabel"] = table#5077 { ["type"] = "literal", ["value"] = "Cycle multiplicity of some total graphs", ["xml:lang"] = "en", }, }, table#5078 { ["itemType"] = table#5079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1732824", }, ["subjectLabel"] = table#5081 { ["type"] = "literal", ["value"] = "Anti-Ramsey numbers for matchings in 3-regular bipartite graphs", ["xml:lang"] = "en", }, }, table#5082 { ["itemType"] = table#5083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1732840", }, ["subjectLabel"] = table#5085 { ["type"] = "literal", ["value"] = "On edge-rupture degree of graphs", ["xml:lang"] = "en", }, }, table#5086 { ["itemType"] = table#5087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1733396", }, ["subjectLabel"] = table#5089 { ["type"] = "literal", ["value"] = "A polynomial algorithm of edge-neighbor-scattering number of trees", ["xml:lang"] = "en", }, }, table#5090 { ["itemType"] = table#5091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1733731", }, ["subjectLabel"] = table#5093 { ["type"] = "literal", ["value"] = "Minimizing Kirchhoff index among graphs with a given vertex bipartiteness", ["xml:lang"] = "en", }, }, table#5094 { ["itemType"] = table#5095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1733851", }, ["subjectLabel"] = table#5097 { ["type"] = "literal", ["value"] = "Pancyclicity of 4-connected \$\\{K_{1,3},Z_8\\}\$-free graphs", ["xml:lang"] = "en", }, }, table#5098 { ["itemType"] = table#5099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1733865", }, ["subjectLabel"] = table#5101 { ["type"] = "literal", ["value"] = "Spanning Eulerian subgraphs of large size", ["xml:lang"] = "en", }, }, table#5102 { ["itemType"] = table#5103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1734306", }, ["subjectLabel"] = table#5105 { ["type"] = "literal", ["value"] = "Edge disjoint paths in hypercubes and folded hypercubes with conditional faults", ["xml:lang"] = "en", }, }, table#5106 { ["itemType"] = table#5107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1734749", }, ["subjectLabel"] = table#5109 { ["type"] = "literal", ["value"] = "On spectral radius and energy of extended adjacency matrix of graphs", ["xml:lang"] = "en", }, }, table#5110 { ["itemType"] = table#5111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1735259", }, ["subjectLabel"] = table#5113 { ["type"] = "literal", ["value"] = "A kind of conditional connectivity of Cayley graphs generated by wheel graphs", ["xml:lang"] = "en", }, }, table#5114 { ["itemType"] = table#5115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1735420", }, ["subjectLabel"] = table#5117 { ["type"] = "literal", ["value"] = "Hardness result for the total rainbow \$k\$-connection of graphs", ["xml:lang"] = "en", }, }, table#5118 { ["itemType"] = table#5119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1736130", }, ["subjectLabel"] = table#5121 { ["type"] = "literal", ["value"] = "Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes", ["xml:lang"] = "en", }, }, table#5122 { ["itemType"] = table#5123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1736137", }, ["subjectLabel"] = table#5125 { ["type"] = "literal", ["value"] = "Enumeration of spanning trees of middle graphs", ["xml:lang"] = "en", }, }, table#5126 { ["itemType"] = table#5127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1737154", }, ["subjectLabel"] = table#5129 { ["type"] = "literal", ["value"] = "Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs", ["xml:lang"] = "en", }, }, table#5130 { ["itemType"] = table#5131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1740035", }, ["subjectLabel"] = table#5133 { ["type"] = "literal", ["value"] = "The classification of \$f\$-coloring of graphs with large maximum degree", ["xml:lang"] = "en", }, }, table#5134 { ["itemType"] = table#5135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1740118", }, ["subjectLabel"] = table#5137 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10", ["xml:lang"] = "en", }, }, table#5138 { ["itemType"] = table#5139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1740156", }, ["subjectLabel"] = table#5141 { ["type"] = "literal", ["value"] = "On the minimum Kirchhoff index of graphs with a given vertex \$k\$-partiteness and edge \$k\$-partiteness", ["xml:lang"] = "en", }, }, table#5142 { ["itemType"] = table#5143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1741515", }, ["subjectLabel"] = table#5145 { ["type"] = "literal", ["value"] = "List matrix partitions of graphs representing geometric configurations", ["xml:lang"] = "en", }, }, table#5146 { ["itemType"] = table#5147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1743683", }, ["subjectLabel"] = table#5149 { ["type"] = "literal", ["value"] = "On the pseudoachromatic index of the complete graph. III", ["xml:lang"] = "en", }, }, table#5150 { ["itemType"] = table#5151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1744746", }, ["subjectLabel"] = table#5153 { ["type"] = "literal", ["value"] = "Planar graphs with maximum degree 4 are strongly 19-edge-colorable", ["xml:lang"] = "en", }, }, table#5154 { ["itemType"] = table#5155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1744755", }, ["subjectLabel"] = table#5157 { ["type"] = "literal", ["value"] = "Pairs of forbidden subgraphs and 2-connected supereulerian graphs", ["xml:lang"] = "en", }, }, table#5158 { ["itemType"] = table#5159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1746577", }, ["subjectLabel"] = table#5161 { ["type"] = "literal", ["value"] = "The monotonicity property of \$M\$-partition problems", ["xml:lang"] = "en", }, }, table#5162 { ["itemType"] = table#5163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1748508", }, ["subjectLabel"] = table#5165 { ["type"] = "literal", ["value"] = "A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs", ["xml:lang"] = "en", }, }, table#5166 { ["itemType"] = table#5167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1749478", }, ["subjectLabel"] = table#5169 { ["type"] = "literal", ["value"] = "Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes", ["xml:lang"] = "en", }, }, table#5170 { ["itemType"] = table#5171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1750216", }, ["subjectLabel"] = table#5173 { ["type"] = "literal", ["value"] = "Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials", ["xml:lang"] = "en", }, }, table#5174 { ["itemType"] = table#5175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1750314", }, ["subjectLabel"] = table#5177 { ["type"] = "literal", ["value"] = "The critical node detection problem in networks: a survey", ["xml:lang"] = "en", }, }, table#5178 { ["itemType"] = table#5179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1872152", }, ["subjectLabel"] = table#5181 { ["type"] = "literal", ["value"] = "Markov additive processes and Perron-Frobenius eigenvalue inequalities", ["xml:lang"] = "en", }, }, table#5182 { ["itemType"] = table#5183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1873586", }, ["subjectLabel"] = table#5185 { ["type"] = "literal", ["value"] = "On \$k\$-ordered graphs involved degree sum", ["xml:lang"] = "en", }, }, table#5186 { ["itemType"] = table#5187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1874378", }, ["subjectLabel"] = table#5189 { ["type"] = "literal", ["value"] = "Total domination and least domination in a tree", ["xml:lang"] = "en", }, }, table#5190 { ["itemType"] = table#5191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1879131", }, ["subjectLabel"] = table#5193 { ["type"] = "literal", ["value"] = "Restricted fault diameter of hypercube networks", ["xml:lang"] = "en", }, }, table#5194 { ["itemType"] = table#5195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1884650", }, ["subjectLabel"] = table#5197 { ["type"] = "literal", ["value"] = "The Erdős-Sós conjecture for graphs whose complements contain no \$C_4\$", ["xml:lang"] = "en", }, }, table#5198 { ["itemType"] = table#5199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1886342", }, ["subjectLabel"] = table#5201 { ["type"] = "literal", ["value"] = "Hamiltonicity of 2-connected \$\\{K_{1,4},K_{1,4}+e\\}\$-free graphs", ["xml:lang"] = "en", }, }, table#5202 { ["itemType"] = table#5203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1887430", }, ["subjectLabel"] = table#5205 { ["type"] = "literal", ["value"] = "On cycles containing a given arc in regular multipartite tournaments", ["xml:lang"] = "en", }, }, table#5206 { ["itemType"] = table#5207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1887634", }, ["subjectLabel"] = table#5209 { ["type"] = "literal", ["value"] = "On removable even circuits in graphs", ["xml:lang"] = "en", }, }, table#5210 { ["itemType"] = table#5211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1893159", }, ["subjectLabel"] = table#5213 { ["type"] = "literal", ["value"] = "The arborescence-realization problem", ["xml:lang"] = "en", }, }, table#5214 { ["itemType"] = table#5215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1894711", }, ["subjectLabel"] = table#5217 { ["type"] = "literal", ["value"] = "Characterizing and recognizing the visibility graph of a funnel-shaped polygon", ["xml:lang"] = "en", }, }, table#5218 { ["itemType"] = table#5219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1894996", }, ["subjectLabel"] = table#5221 { ["type"] = "literal", ["value"] = "An inverse problem of the weighted shortest path problem", ["xml:lang"] = "en", }, }, table#5222 { ["itemType"] = table#5223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1898328", }, ["subjectLabel"] = table#5225 { ["type"] = "literal", ["value"] = "The S-C-L graph in chemical kinetics", ["xml:lang"] = "en", }, }, table#5226 { ["itemType"] = table#5227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1898892", }, ["subjectLabel"] = table#5229 { ["type"] = "literal", ["value"] = "Two new sufficient conditions for Hamilton-connected graphs", ["xml:lang"] = "en", }, }, table#5230 { ["itemType"] = table#5231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1898897", }, ["subjectLabel"] = table#5233 { ["type"] = "literal", ["value"] = "On bandwidth sums of graphs", ["xml:lang"] = "en", }, }, table#5234 { ["itemType"] = table#5235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1899015", }, ["subjectLabel"] = table#5237 { ["type"] = "literal", ["value"] = "On upper bounds of bandwidths of trees", ["xml:lang"] = "en", }, }, table#5238 { ["itemType"] = table#5239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1899021", }, ["subjectLabel"] = table#5241 { ["type"] = "literal", ["value"] = "On a conjecture concerning \$k\$-Hamilton-nice sequences", ["xml:lang"] = "en", }, }, table#5242 { ["itemType"] = table#5243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1904391", }, ["subjectLabel"] = table#5245 { ["type"] = "literal", ["value"] = "Upward planarity testing", ["xml:lang"] = "en", }, }, table#5246 { ["itemType"] = table#5247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1906858", }, ["subjectLabel"] = table#5249 { ["type"] = "literal", ["value"] = "The chromatic polynomial between graph \\& its complement---about Akiyama and Harary's open problem", ["xml:lang"] = "en", }, }, table#5250 { ["itemType"] = table#5251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1906861", }, ["subjectLabel"] = table#5253 { ["type"] = "literal", ["value"] = "\$D_ \\lambda\$-cycles in 3-cyclable graphs", ["xml:lang"] = "en", }, }, table#5254 { ["itemType"] = table#5255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1908929", }, ["subjectLabel"] = table#5257 { ["type"] = "literal", ["value"] = "A special case of set covering problems", ["xml:lang"] = "en", }, }, table#5258 { ["itemType"] = table#5259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1911241", }, ["subjectLabel"] = table#5261 { ["type"] = "literal", ["value"] = "On fixing edges in graph minors", ["xml:lang"] = "en", }, }, table#5262 { ["itemType"] = table#5263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1915807", }, ["subjectLabel"] = table#5265 { ["type"] = "literal", ["value"] = "On the partial order polytope of a digraph", ["xml:lang"] = "en", }, }, table#5266 { ["itemType"] = table#5267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1920422", }, ["subjectLabel"] = table#5269 { ["type"] = "literal", ["value"] = "Characterizing proximity trees", ["xml:lang"] = "en", }, }, table#5270 { ["itemType"] = table#5271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1920760", }, ["subjectLabel"] = table#5273 { ["type"] = "literal", ["value"] = "Dominating sets and Hamiltonicity in \$K_{1,3}\$-free graphs", ["xml:lang"] = "en", }, }, table#5274 { ["itemType"] = table#5275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1922638", }, ["subjectLabel"] = table#5277 { ["type"] = "literal", ["value"] = "Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control", ["xml:lang"] = "en", }, }, table#5278 { ["itemType"] = table#5279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1923512", }, ["subjectLabel"] = table#5281 { ["type"] = "literal", ["value"] = "Hamiltonian cycles in regular 3-connected claw-free graphs", ["xml:lang"] = "en", }, }, table#5282 { ["itemType"] = table#5283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1923776", }, ["subjectLabel"] = table#5285 { ["type"] = "literal", ["value"] = "Some panconnected and pancyclic properties of graphs with a local Ore-type condition", ["xml:lang"] = "en", }, }, table#5286 { ["itemType"] = table#5287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1923778", }, ["subjectLabel"] = table#5289 { ["type"] = "literal", ["value"] = "Extensions and consequences of Chvátal-Erdös' theorem", ["xml:lang"] = "en", }, }, table#5290 { ["itemType"] = table#5291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1924570", }, ["subjectLabel"] = table#5293 { ["type"] = "literal", ["value"] = "An application of coding theory to a problem in graphical enumeration", ["xml:lang"] = "en", }, }, table#5294 { ["itemType"] = table#5295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926023", }, ["subjectLabel"] = table#5297 { ["type"] = "literal", ["value"] = "Group connectivity in 3-edge-connected graphs", ["xml:lang"] = "en", }, }, table#5298 { ["itemType"] = table#5299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926026", }, ["subjectLabel"] = table#5301 { ["type"] = "literal", ["value"] = "The connectivity and diameter of second order circuit graphs of matroids", ["xml:lang"] = "en", }, }, table#5302 { ["itemType"] = table#5303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1750334", }, ["subjectLabel"] = table#5305 { ["type"] = "literal", ["value"] = "The relationship between attribute reducts in rough sets and minimal vertex covers of graphs", ["xml:lang"] = "en", }, }, table#5306 { ["itemType"] = table#5307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1751415", }, ["subjectLabel"] = table#5309 { ["type"] = "literal", ["value"] = "The connectivity of generalized graph products", ["xml:lang"] = "en", }, }, table#5310 { ["itemType"] = table#5311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1751423", }, ["subjectLabel"] = table#5313 { ["type"] = "literal", ["value"] = "The number of spanning trees of a class of self-similar fractal models", ["xml:lang"] = "en", }, }, table#5314 { ["itemType"] = table#5315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1751754", }, ["subjectLabel"] = table#5317 { ["type"] = "literal", ["value"] = "An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system", ["xml:lang"] = "en", }, }, table#5318 { ["itemType"] = table#5319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1751939", }, ["subjectLabel"] = table#5321 { ["type"] = "literal", ["value"] = "Integrated optimization of strategic and tactical planning decisions in forestry", ["xml:lang"] = "en", }, }, table#5322 { ["itemType"] = table#5323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752455", }, ["subjectLabel"] = table#5325 { ["type"] = "literal", ["value"] = "On distance-preserving elimination orderings in graphs: complexity and algorithms", ["xml:lang"] = "en", }, }, table#5326 { ["itemType"] = table#5327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752466", }, ["subjectLabel"] = table#5329 { ["type"] = "literal", ["value"] = "Rainbow connections in digraphs", ["xml:lang"] = "en", }, }, table#5330 { ["itemType"] = table#5331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752467", }, ["subjectLabel"] = table#5333 { ["type"] = "literal", ["value"] = "Upper bounds of \$r\$-hued colorings of planar graphs", ["xml:lang"] = "en", }, }, table#5334 { ["itemType"] = table#5335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752481", }, ["subjectLabel"] = table#5337 { ["type"] = "literal", ["value"] = "On compatibility and incompatibility of collections of unrooted phylogenetic trees", ["xml:lang"] = "en", }, }, table#5338 { ["itemType"] = table#5339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752491", }, ["subjectLabel"] = table#5341 { ["type"] = "literal", ["value"] = "On the contour of bipartite graphs", ["xml:lang"] = "en", }, }, table#5342 { ["itemType"] = table#5343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752593", }, ["subjectLabel"] = table#5345 { ["type"] = "literal", ["value"] = "Reliability analysis of Cayley graphs generated by transpositions", ["xml:lang"] = "en", }, }, table#5346 { ["itemType"] = table#5347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752596", }, ["subjectLabel"] = table#5349 { ["type"] = "literal", ["value"] = "Planar graphs without chordal 6-cycles are 4-choosable", ["xml:lang"] = "en", }, }, table#5350 { ["itemType"] = table#5351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752606", }, ["subjectLabel"] = table#5353 { ["type"] = "literal", ["value"] = "A note on 2-bisections of claw-free cubic graphs", ["xml:lang"] = "en", }, }, table#5354 { ["itemType"] = table#5355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752609", }, ["subjectLabel"] = table#5357 { ["type"] = "literal", ["value"] = "Edge-disjoint spanning trees and the number of maximum state circles of a graph", ["xml:lang"] = "en", }, }, table#5358 { ["itemType"] = table#5359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1752690", }, ["subjectLabel"] = table#5361 { ["type"] = "literal", ["value"] = "Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems", ["xml:lang"] = "en", }, }, table#5362 { ["itemType"] = table#5363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1753370", }, ["subjectLabel"] = table#5365 { ["type"] = "literal", ["value"] = "Neighbor connectivity of two kinds of Cayley graphs", ["xml:lang"] = "en", }, }, table#5366 { ["itemType"] = table#5367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1754544", }, ["subjectLabel"] = table#5369 { ["type"] = "literal", ["value"] = "No hexavalent half-arc-transitive graphs of order twice a prime square exist", ["xml:lang"] = "en", }, }, table#5370 { ["itemType"] = table#5371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1754555", }, ["subjectLabel"] = table#5373 { ["type"] = "literal", ["value"] = "A generalization of zero divisor graphs associated to commutative rings", ["xml:lang"] = "en", }, }, table#5374 { ["itemType"] = table#5375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1754638", }, ["subjectLabel"] = table#5377 { ["type"] = "literal", ["value"] = "A generalization of total graphs", ["xml:lang"] = "en", }, }, table#5378 { ["itemType"] = table#5379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1755582", }, ["subjectLabel"] = table#5381 { ["type"] = "literal", ["value"] = "Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity", ["xml:lang"] = "en", }, }, table#5382 { ["itemType"] = table#5383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1756085", }, ["subjectLabel"] = table#5385 { ["type"] = "literal", ["value"] = "Bounds for judicious balanced bipartitions of graphs", ["xml:lang"] = "en", }, }, table#5386 { ["itemType"] = table#5387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1757981", }, ["subjectLabel"] = table#5389 { ["type"] = "literal", ["value"] = "Light subgraphs in the family of 1-planar graphs with high minimum degree", ["xml:lang"] = "en", }, }, table#5390 { ["itemType"] = table#5391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1757999", }, ["subjectLabel"] = table#5393 { ["type"] = "literal", ["value"] = "Domination numbers of undirected toroidal mesh", ["xml:lang"] = "en", }, }, table#5394 { ["itemType"] = table#5395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1758120", }, ["subjectLabel"] = table#5397 { ["type"] = "literal", ["value"] = "Existence of rainbow matchings in properly edge-colored graphs", ["xml:lang"] = "en", }, }, table#5398 { ["itemType"] = table#5399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1760686", }, ["subjectLabel"] = table#5401 { ["type"] = "literal", ["value"] = "On arc connectivity of direct-product digraphs", ["xml:lang"] = "en", }, }, table#5402 { ["itemType"] = table#5403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1760722", }, ["subjectLabel"] = table#5405 { ["type"] = "literal", ["value"] = "The Merrifield-Simmons index and Hosoya index of \$C(n, k, \\lambda)\$ graphs", ["xml:lang"] = "en", }, }, table#5406 { ["itemType"] = table#5407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1763338", }, ["subjectLabel"] = table#5409 { ["type"] = "literal", ["value"] = "Hamiltonian jump graphs", ["xml:lang"] = "en", }, }, table#5410 { ["itemType"] = table#5411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1764381", }, ["subjectLabel"] = table#5413 { ["type"] = "literal", ["value"] = "\$(g,f)\$-factors with special properties in bipartite \$(mg,mf)\$-graphs", ["xml:lang"] = "en", }, }, table#5414 { ["itemType"] = table#5415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1764382", }, ["subjectLabel"] = table#5417 { ["type"] = "literal", ["value"] = "Largest eigenvalue of a unicyclic mixed graphs", ["xml:lang"] = "en", }, }, table#5418 { ["itemType"] = table#5419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1764384", }, ["subjectLabel"] = table#5421 { ["type"] = "literal", ["value"] = "Two feedback problems for graphs with bounded tree-width", ["xml:lang"] = "en", }, }, table#5422 { ["itemType"] = table#5423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1775286", }, ["subjectLabel"] = table#5425 { ["type"] = "literal", ["value"] = "Neighborhood union of independent sets and Hamiltonicity of claw-free graphs", ["xml:lang"] = "en", }, }, table#5426 { ["itemType"] = table#5427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1781984", }, ["subjectLabel"] = table#5429 { ["type"] = "literal", ["value"] = "On edge domination numbers of graphs", ["xml:lang"] = "en", }, }, table#5430 { ["itemType"] = table#5431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1782023", }, ["subjectLabel"] = table#5433 { ["type"] = "literal", ["value"] = "A note on directed genera of some tournaments", ["xml:lang"] = "en", }, }, table#5434 { ["itemType"] = table#5435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1782047", }, ["subjectLabel"] = table#5437 { ["type"] = "literal", ["value"] = "Neighborhood conditions for fractional ID-\$k\$-factor-critical graphs", ["xml:lang"] = "en", }, }, table#5438 { ["itemType"] = table#5439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1786886", }, ["subjectLabel"] = table#5441 { ["type"] = "literal", ["value"] = "Graphs of \$f\$-class 1", ["xml:lang"] = "en", }, }, table#5442 { ["itemType"] = table#5443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1786967", }, ["subjectLabel"] = table#5445 { ["type"] = "literal", ["value"] = "Graphs having extremal monotonic topological indices with bounded vertex \$k\$-partiteness", ["xml:lang"] = "en", }, }, table#5446 { ["itemType"] = table#5447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1787432", }, ["subjectLabel"] = table#5449 { ["type"] = "literal", ["value"] = "A new type-2 soft set: type-2 soft graphs and their applications", ["xml:lang"] = "en", }, }, table#5450 { ["itemType"] = table#5451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1793386", }, ["subjectLabel"] = table#5453 { ["type"] = "literal", ["value"] = "The existence of spanning ended system on claw-free graphs", ["xml:lang"] = "en", }, }, table#5454 { ["itemType"] = table#5455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1793577", }, ["subjectLabel"] = table#5457 { ["type"] = "literal", ["value"] = "Dynamic characterization of typical electrical circuits via structural properties", ["xml:lang"] = "en", }, }, table#5458 { ["itemType"] = table#5459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1795036", }, ["subjectLabel"] = table#5461 { ["type"] = "literal", ["value"] = "An uncertain chromatic number of an uncertain graph based on \$\\alpha \$-cut coloring", ["xml:lang"] = "en", }, }, table#5462 { ["itemType"] = table#5463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1799144", }, ["subjectLabel"] = table#5465 { ["type"] = "literal", ["value"] = "Enumeration of Wiener indices in random polygonal chains", ["xml:lang"] = "en", }, }, table#5466 { ["itemType"] = table#5467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1799219", }, ["subjectLabel"] = table#5469 { ["type"] = "literal", ["value"] = "Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications", ["xml:lang"] = "en", }, }, table#5470 { ["itemType"] = table#5471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1800416", }, ["subjectLabel"] = table#5473 { ["type"] = "literal", ["value"] = "Essential edge connectivity of line graphs", ["xml:lang"] = "en", }, }, table#5474 { ["itemType"] = table#5475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1801067", }, ["subjectLabel"] = table#5477 { ["type"] = "literal", ["value"] = "On eccentric distance sum and degree distance of graphs", ["xml:lang"] = "en", }, }, table#5478 { ["itemType"] = table#5479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1805370", }, ["subjectLabel"] = table#5481 { ["type"] = "literal", ["value"] = "Degree sums, \$k\$-factors and Hamilton cycles in graphs", ["xml:lang"] = "en", }, }, table#5482 { ["itemType"] = table#5483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1807859", }, ["subjectLabel"] = table#5485 { ["type"] = "literal", ["value"] = "Some results on \$R_2\$-edge-connectivity of even regular graphs", ["xml:lang"] = "en", }, }, table#5486 { ["itemType"] = table#5487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1812683", }, ["subjectLabel"] = table#5489 { ["type"] = "literal", ["value"] = "Embeddings of graphs in Euclidean spaces", ["xml:lang"] = "en", }, }, table#5490 { ["itemType"] = table#5491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1813087", }, ["subjectLabel"] = table#5493 { ["type"] = "literal", ["value"] = "Regular subpseudographs of regular pseudographs", ["xml:lang"] = "en", }, }, table#5494 { ["itemType"] = table#5495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1813717", }, ["subjectLabel"] = table#5497 { ["type"] = "literal", ["value"] = "On barrier sets of star-factors", ["xml:lang"] = "en", }, }, table#5498 { ["itemType"] = table#5499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1815335", }, ["subjectLabel"] = table#5501 { ["type"] = "literal", ["value"] = "Fixed points of boundary-preserving maps of punctured discs", ["xml:lang"] = "en", }, }, table#5502 { ["itemType"] = table#5503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1821116", }, ["subjectLabel"] = table#5505 { ["type"] = "literal", ["value"] = "Extremal clique coverings of complementary graphs", ["xml:lang"] = "en", }, }, table#5506 { ["itemType"] = table#5507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1825879", }, ["subjectLabel"] = table#5509 { ["type"] = "literal", ["value"] = "The Steinberg module of a graph", ["xml:lang"] = "en", }, }, table#5510 { ["itemType"] = table#5511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1827784", }, ["subjectLabel"] = table#5513 { ["type"] = "literal", ["value"] = "Hamiltonicity of 2-connected quasi-claw-free graphs", ["xml:lang"] = "en", }, }, table#5514 { ["itemType"] = table#5515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1827833", }, ["subjectLabel"] = table#5517 { ["type"] = "literal", ["value"] = "On the construction of most reliable networks", ["xml:lang"] = "en", }, }, table#5518 { ["itemType"] = table#5519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1835926", }, ["subjectLabel"] = table#5521 { ["type"] = "literal", ["value"] = "Edge-colorability of graph bundles", ["xml:lang"] = "en", }, }, table#5522 { ["itemType"] = table#5523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1837207", }, ["subjectLabel"] = table#5525 { ["type"] = "literal", ["value"] = "On line disjoint paths of bounded length", ["xml:lang"] = "en", }, }, table#5526 { ["itemType"] = table#5527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1837702", }, ["subjectLabel"] = table#5529 { ["type"] = "literal", ["value"] = "Bipartite cubic graphs and a shortness exponent", ["xml:lang"] = "en", }, }, table#5530 { ["itemType"] = table#5531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1838497", }, ["subjectLabel"] = table#5533 { ["type"] = "literal", ["value"] = "Vertex-transitive graphs of valency 3", ["xml:lang"] = "en", }, }, table#5534 { ["itemType"] = table#5535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1838976", }, ["subjectLabel"] = table#5537 { ["type"] = "literal", ["value"] = "Short cycles in mediate graphs", ["xml:lang"] = "en", }, }, table#5538 { ["itemType"] = table#5539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1838984", }, ["subjectLabel"] = table#5541 { ["type"] = "literal", ["value"] = "Graphs with three mutually pseudo-similar vertices", ["xml:lang"] = "en", }, }, table#5542 { ["itemType"] = table#5543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1847585", }, ["subjectLabel"] = table#5545 { ["type"] = "literal", ["value"] = "\$[2,3]\$-factors in a 3-connected infinite planar graph.", ["xml:lang"] = "en", }, }, table#5546 { ["itemType"] = table#5547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1847635", }, ["subjectLabel"] = table#5549 { ["type"] = "literal", ["value"] = "\$w\$-density and \$w\$-balanced property of weighted graphs", ["xml:lang"] = "en", }, }, table#5550 { ["itemType"] = table#5551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1847637", }, ["subjectLabel"] = table#5553 { ["type"] = "literal", ["value"] = "Properties of spectra of graphs and line graphs", ["xml:lang"] = "en", }, }, table#5554 { ["itemType"] = table#5555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1848742", }, ["subjectLabel"] = table#5557 { ["type"] = "literal", ["value"] = "A manifold independent approach to understanding transport in stochastic dynamical systems", ["xml:lang"] = "en", }, }, table#5558 { ["itemType"] = table#5559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1850583", }, ["subjectLabel"] = table#5561 { ["type"] = "literal", ["value"] = "The numbers of dependent \$k\$-sets in a graph are log concave", ["xml:lang"] = "en", }, }, table#5562 { ["itemType"] = table#5563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1850616", }, ["subjectLabel"] = table#5565 { ["type"] = "literal", ["value"] = "Coloring face-hypergraphs of graphs on surfaces", ["xml:lang"] = "en", }, }, table#5566 { ["itemType"] = table#5567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1862823", }, ["subjectLabel"] = table#5569 { ["type"] = "literal", ["value"] = "On the monotonicity of \$(k;g,h)\$-graphs", ["xml:lang"] = "en", }, }, table#5570 { ["itemType"] = table#5571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1862827", }, ["subjectLabel"] = table#5573 { ["type"] = "literal", ["value"] = "Randomly orthogonal \$(g,f)\$-factorizations in graphs", ["xml:lang"] = "en", }, }, table#5574 { ["itemType"] = table#5575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1869527", }, ["subjectLabel"] = table#5577 { ["type"] = "literal", ["value"] = "Optimal control of service rates and arrivals in Jackson networks", ["xml:lang"] = "en", }, }, table#5578 { ["itemType"] = table#5579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4956565", }, ["subjectLabel"] = table#5581 { ["type"] = "literal", ["value"] = "THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G", ["xml:lang"] = "en", }, }, table#5582 { ["itemType"] = table#5583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5031864", }, ["subjectLabel"] = table#5585 { ["type"] = "literal", ["value"] = "On extension of regular graphs", ["xml:lang"] = "en", }, }, table#5586 { ["itemType"] = table#5587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4963120", }, ["subjectLabel"] = table#5589 { ["type"] = "literal", ["value"] = "ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH", ["xml:lang"] = "en", }, }, table#5590 { ["itemType"] = table#5591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5034291", }, ["subjectLabel"] = table#5593 { ["type"] = "literal", ["value"] = "Inverse degree, Randic index and harmonic index of graphs", ["xml:lang"] = "en", }, }, table#5594 { ["itemType"] = table#5595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5034516", }, ["subjectLabel"] = table#5597 { ["type"] = "literal", ["value"] = "Laplacian spread and some Hamiltonian properties of graphs", ["xml:lang"] = "en", }, }, table#5598 { ["itemType"] = table#5599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5034539", }, ["subjectLabel"] = table#5601 { ["type"] = "literal", ["value"] = "Some exact values for p(t, d)", ["xml:lang"] = "en", }, }, table#5602 { ["itemType"] = table#5603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5035805", }, ["subjectLabel"] = table#5605 { ["type"] = "literal", ["value"] = "Minimum diameter and t_F(f, q)", ["xml:lang"] = "en", }, }, table#5606 { ["itemType"] = table#5607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5036675", }, ["subjectLabel"] = table#5609 { ["type"] = "literal", ["value"] = "Chromatic connected domination in graphs", ["xml:lang"] = "en", }, }, table#5610 { ["itemType"] = table#5611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5036728", }, ["subjectLabel"] = table#5613 { ["type"] = "literal", ["value"] = "The rainbow connectivity of cartesian product graphs", ["xml:lang"] = "en", }, }, table#5614 { ["itemType"] = table#5615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4958095", }, ["subjectLabel"] = table#5617 { ["type"] = "literal", ["value"] = "Integrity of graph operations", ["xml:lang"] = "en", }, }, table#5618 { ["itemType"] = table#5619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5041973", }, ["subjectLabel"] = table#5621 { ["type"] = "literal", ["value"] = "The connected graphs obtained from finite projective planes", ["xml:lang"] = "en", }, }, table#5622 { ["itemType"] = table#5623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5042557", }, ["subjectLabel"] = table#5625 { ["type"] = "literal", ["value"] = "AVD proper edge-coloring of some families of graphs", ["xml:lang"] = "en", }, }, table#5626 { ["itemType"] = table#5627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5043952", }, ["subjectLabel"] = table#5629 { ["type"] = "literal", ["value"] = "On intersecting straight line systems", ["xml:lang"] = "en", }, }, table#5630 { ["itemType"] = table#5631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5051192", }, ["subjectLabel"] = table#5633 { ["type"] = "literal", ["value"] = "Temporal concatenation for Markov decision processes", ["xml:lang"] = "en", }, }, table#5634 { ["itemType"] = table#5635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5051392", }, ["subjectLabel"] = table#5637 { ["type"] = "literal", ["value"] = "Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges", ["xml:lang"] = "en", }, }, table#5638 { ["itemType"] = table#5639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5054054", }, ["subjectLabel"] = table#5641 { ["type"] = "literal", ["value"] = "Bounds on the connectivity of iterated line graphs", ["xml:lang"] = "en", }, }, table#5642 { ["itemType"] = table#5643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5054759", }, ["subjectLabel"] = table#5645 { ["type"] = "literal", ["value"] = "Sequential and parallel algorithms for embedding problems on classes of partial k-trees", ["xml:lang"] = "en", }, }, table#5646 { ["itemType"] = table#5647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5054815", }, ["subjectLabel"] = table#5649 { ["type"] = "literal", ["value"] = "Neighborhood graphs and distributed Δ+1-coloring", ["xml:lang"] = "en", }, }, table#5650 { ["itemType"] = table#5651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5056113", }, ["subjectLabel"] = table#5653 { ["type"] = "literal", ["value"] = "Canonical representations of partial 2-and 3-trees", ["xml:lang"] = "en", }, }, table#5654 { ["itemType"] = table#5655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5057448", }, ["subjectLabel"] = table#5657 { ["type"] = "literal", ["value"] = "Computing a dominating pair in an asteroidal triple-free graph in linear time", ["xml:lang"] = "en", }, }, table#5658 { ["itemType"] = table#5659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5060153", }, ["subjectLabel"] = table#5661 { ["type"] = "literal", ["value"] = "Practical algorithms on partial k-trees with an application to domination-like problems", ["xml:lang"] = "en", }, }, table#5662 { ["itemType"] = table#5663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5061682", }, ["subjectLabel"] = table#5665 { ["type"] = "literal", ["value"] = "Integrity of total transformation graphs", ["xml:lang"] = "en", }, }, table#5666 { ["itemType"] = table#5667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4953538", }, ["subjectLabel"] = table#5669 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4953538", }, }, table#5670 { ["itemType"] = table#5671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5063273", }, ["subjectLabel"] = table#5673 { ["type"] = "literal", ["value"] = "On r-dynamic vertex coloring of some flower graph families", ["xml:lang"] = "en", }, }, table#5674 { ["itemType"] = table#5675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5068493", }, ["subjectLabel"] = table#5677 { ["type"] = "literal", ["value"] = "UNIT AND UNITARY CAYLEY GRAPHS FOR THE RING OF EISENSTEIN INTEGERS MODULO \$n\$", ["xml:lang"] = "en", }, }, table#5678 { ["itemType"] = table#5679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069204", }, ["subjectLabel"] = table#5681 { ["type"] = "literal", ["value"] = "Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth", ["xml:lang"] = "en", }, }, table#5682 { ["itemType"] = table#5683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069684", }, ["subjectLabel"] = table#5685 { ["type"] = "literal", ["value"] = "Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph", ["xml:lang"] = "en", }, }, table#5686 { ["itemType"] = table#5687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069747", }, ["subjectLabel"] = table#5689 { ["type"] = "literal", ["value"] = "Signless Laplacian Spectral Radius and Some Hamiltonian Properties of Graphs", ["xml:lang"] = "en", }, }, table#5690 { ["itemType"] = table#5691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4964831", }, ["subjectLabel"] = table#5693 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4964831", }, }, table#5694 { ["itemType"] = table#5695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4965339", }, ["subjectLabel"] = table#5697 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4965339", }, }, table#5698 { ["itemType"] = table#5699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4944682", }, ["subjectLabel"] = table#5701 { ["type"] = "literal", ["value"] = "Maximal sets of Hamilton cycles inKn,n", ["xml:lang"] = "en", }, }, table#5702 { ["itemType"] = table#5703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4946546", }, ["subjectLabel"] = table#5705 { ["type"] = "literal", ["value"] = "(2 + ?)-Coloring of planar graphs with large odd-girth", ["xml:lang"] = "en", }, }, table#5706 { ["itemType"] = table#5707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4946547", }, ["subjectLabel"] = table#5709 { ["type"] = "literal", ["value"] = "On convex embeddings of planar 3-connected graphs", ["xml:lang"] = "en", }, }, table#5710 { ["itemType"] = table#5711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4987216", }, ["subjectLabel"] = table#5713 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4987216", }, }, table#5714 { ["itemType"] = table#5715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4988597", }, ["subjectLabel"] = table#5717 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4988597", }, }, table#5718 { ["itemType"] = table#5719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4990102", }, ["subjectLabel"] = table#5721 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4990102", }, }, table#5722 { ["itemType"] = table#5723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4990108", }, ["subjectLabel"] = table#5725 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4990108", }, }, table#5726 { ["itemType"] = table#5727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4994280", }, ["subjectLabel"] = table#5729 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4994280", }, }, table#5730 { ["itemType"] = table#5731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4857445", }, ["subjectLabel"] = table#5733 { ["type"] = "literal", ["value"] = "Cycles through particular subgraphs of claw‐free graphs", ["xml:lang"] = "en", }, }, table#5734 { ["itemType"] = table#5735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4857450", }, ["subjectLabel"] = table#5737 { ["type"] = "literal", ["value"] = "Biclosure and bistability in a balanced bipartite graph", ["xml:lang"] = "en", }, }, table#5738 { ["itemType"] = table#5739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5000319", }, ["subjectLabel"] = table#5741 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5000319", }, }, table#5742 { ["itemType"] = table#5743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5000742", }, ["subjectLabel"] = table#5745 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5000742", }, }, table#5746 { ["itemType"] = table#5747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5001002", }, ["subjectLabel"] = table#5749 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5001002", }, }, table#5750 { ["itemType"] = table#5751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5026982", }, ["subjectLabel"] = table#5753 { ["type"] = "literal", ["value"] = "4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles", ["xml:lang"] = "en", }, }, table#5754 { ["itemType"] = table#5755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4873484", }, ["subjectLabel"] = table#5757 { ["type"] = "literal", ["value"] = "The characterization of symmetric primitive matrices with exponent 2n−2r(n)^∗", ["xml:lang"] = "en", }, }, table#5758 { ["itemType"] = table#5759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5041950", }, ["subjectLabel"] = table#5761 { ["type"] = "literal", ["value"] = "On $k$-Super Graceful Labeling of Graphs", ["xml:lang"] = "en", }, }, table#5762 { ["itemType"] = table#5763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5052677", }, ["subjectLabel"] = table#5765 { ["type"] = "literal", ["value"] = "Coincidence point results for graph preserving hybrid pair of mappings", ["xml:lang"] = "en", }, }, table#5766 { ["itemType"] = table#5767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5020334", }, ["subjectLabel"] = table#5769 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5020334", }, }, table#5770 { ["itemType"] = table#5771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5064391", }, ["subjectLabel"] = table#5773 { ["type"] = "literal", ["value"] = "ANNIHILATING-IDEAL GRAPH OF C(X)", ["xml:lang"] = "en", }, }, table#5774 { ["itemType"] = table#5775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4894876", }, ["subjectLabel"] = table#5777 { ["type"] = "literal", ["value"] = "Bipartite regular graphs with fixed diameter", ["xml:lang"] = "en", }, }, table#5778 { ["itemType"] = table#5779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4894877", }, ["subjectLabel"] = table#5781 { ["type"] = "literal", ["value"] = "Hamilton cycles and paths in butterfly graphs", ["xml:lang"] = "en", }, }, table#5782 { ["itemType"] = table#5783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5037960", }, ["subjectLabel"] = table#5785 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5037960", }, }, table#5786 { ["itemType"] = table#5787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5037964", }, ["subjectLabel"] = table#5789 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5037964", }, }, table#5790 { ["itemType"] = table#5791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4897049", }, ["subjectLabel"] = table#5793 { ["type"] = "literal", ["value"] = "Almost all Cayley graphs are hamiltonian", ["xml:lang"] = "en", }, }, table#5794 { ["itemType"] = table#5795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5041845", }, ["subjectLabel"] = table#5797 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5041845", }, }, table#5798 { ["itemType"] = table#5799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4903572", }, ["subjectLabel"] = table#5801 { ["type"] = "literal", ["value"] = "Inverse degree and super edge-connectivity", ["xml:lang"] = "en", }, }, table#5802 { ["itemType"] = table#5803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4903632", }, ["subjectLabel"] = table#5805 { ["type"] = "literal", ["value"] = "NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS", ["xml:lang"] = "en", }, }, table#5806 { ["itemType"] = table#5807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4916163", }, ["subjectLabel"] = table#5809 { ["type"] = "literal", ["value"] = "ON THE COZERO-DIVISOR GRAPHS AND COMAXIMAL GRAPHS OF COMMUTATIVE RINGS", ["xml:lang"] = "en", }, }, table#5810 { ["itemType"] = table#5811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5064395", }, ["subjectLabel"] = table#5813 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5064395", }, }, table#5814 { ["itemType"] = table#5815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4923192", }, ["subjectLabel"] = table#5817 { ["type"] = "literal", ["value"] = "A DESCRIPTION OF A CLASS OF FINITE SEMIGROUPS THAT ARE NEAR TO BEING MAL'CEV NILPOTENT", ["xml:lang"] = "en", }, }, table#5818 { ["itemType"] = table#5819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4923922", }, ["subjectLabel"] = table#5821 { ["type"] = "literal", ["value"] = "CAYLEY GRAPHS OF PARTIALLY ORDERED SETS", ["xml:lang"] = "en", }, }, table#5822 { ["itemType"] = table#5823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4924061", }, ["subjectLabel"] = table#5825 { ["type"] = "literal", ["value"] = "Minimal functional routes in directed graphs with dependent edges", ["xml:lang"] = "en", }, }, table#5826 { ["itemType"] = table#5827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4925971", }, ["subjectLabel"] = table#5829 { ["type"] = "literal", ["value"] = "Some structural properties of 2-walk (a, b)-linear graphs", ["xml:lang"] = "en", }, }, table#5830 { ["itemType"] = table#5831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4942589", }, ["subjectLabel"] = table#5833 { ["type"] = "literal", ["value"] = "Algebraic connectivity and the characteristic set of a graph", ["xml:lang"] = "en", }, }, table#5834 { ["itemType"] = table#5835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4956176", }, ["subjectLabel"] = table#5837 { ["type"] = "literal", ["value"] = "On the maximum spectral radius of multipartite graphs", ["xml:lang"] = "en", }, }, table#5838 { ["itemType"] = table#5839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4956236", }, ["subjectLabel"] = table#5841 { ["type"] = "literal", ["value"] = "The matching number and Hamiltonicity of graphs", ["xml:lang"] = "en", }, }, table#5842 { ["itemType"] = table#5843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4957997", }, ["subjectLabel"] = table#5845 { ["type"] = "literal", ["value"] = "Some structural graph properties of the non-commuting graph of a class of finite Moufang loops", ["xml:lang"] = "en", }, }, table#5846 { ["itemType"] = table#5847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4965905", }, ["subjectLabel"] = table#5849 { ["type"] = "literal", ["value"] = "Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges", ["xml:lang"] = "en", }, }, table#5850 { ["itemType"] = table#5851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4966732", }, ["subjectLabel"] = table#5853 { ["type"] = "literal", ["value"] = "Generalised colouring sums of graphs", ["xml:lang"] = "en", }, }, table#5854 { ["itemType"] = table#5855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4966765", }, ["subjectLabel"] = table#5857 { ["type"] = "literal", ["value"] = "A study on total irregularities of certain graphs and digraphs", ["xml:lang"] = "en", }, }, table#5858 { ["itemType"] = table#5859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4971386", }, ["subjectLabel"] = table#5861 { ["type"] = "literal", ["value"] = "Informational Braess’ Paradox: The Effect of Information on Traffic Congestion", ["xml:lang"] = "en", }, }, table#5862 { ["itemType"] = table#5863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4973416", }, ["subjectLabel"] = table#5865 { ["type"] = "literal", ["value"] = "ON THE CORONA PRODUCT OF MONOGENIC SEMIGROUP GRAPHS", ["xml:lang"] = "en", }, }, table#5866 { ["itemType"] = table#5867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4976338", }, ["subjectLabel"] = table#5869 { ["type"] = "literal", ["value"] = "A polynomial time algorithm for cyclic vertex connectivity of cubic graphs", ["xml:lang"] = "en", }, }, table#5870 { ["itemType"] = table#5871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4982286", }, ["subjectLabel"] = table#5873 { ["type"] = "literal", ["value"] = "Rainbow Numbers for Cycles in Plane Triangulations", ["xml:lang"] = "en", }, }, table#5874 { ["itemType"] = table#5875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4983266", }, ["subjectLabel"] = table#5877 { ["type"] = "literal", ["value"] = "The bicube: an interconnection of two hypercubes", ["xml:lang"] = "en", }, }, table#5878 { ["itemType"] = table#5879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993501", }, ["subjectLabel"] = table#5881 { ["type"] = "literal", ["value"] = "Rethinking arithmetic for deep neural networks", ["xml:lang"] = "en", }, }, table#5882 { ["itemType"] = table#5883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5006583", }, ["subjectLabel"] = table#5885 { ["type"] = "literal", ["value"] = "On some covering graphs of a graph", ["xml:lang"] = "en", }, }, table#5886 { ["itemType"] = table#5887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5006624", }, ["subjectLabel"] = table#5889 { ["type"] = "literal", ["value"] = "Bounds for the Laplacian spectral radius of graphs", ["xml:lang"] = "en", }, }, table#5890 { ["itemType"] = table#5891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5009123", }, ["subjectLabel"] = table#5893 { ["type"] = "literal", ["value"] = "Central Graph of Quadrilateral Snakes with Chromatic Number", ["xml:lang"] = "en", }, }, table#5894 { ["itemType"] = table#5895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5009936", }, ["subjectLabel"] = table#5897 { ["type"] = "literal", ["value"] = "Clique roots of K4-free chordal graphs", ["xml:lang"] = "en", }, }, table#5898 { ["itemType"] = table#5899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5009949", }, ["subjectLabel"] = table#5901 { ["type"] = "literal", ["value"] = "On the Steiner antipodal number of graphs", ["xml:lang"] = "en", }, }, table#5902 { ["itemType"] = table#5903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5009953", }, ["subjectLabel"] = table#5905 { ["type"] = "literal", ["value"] = "The second least eigenvalue of the signless Laplacian of the complements of trees", ["xml:lang"] = "en", }, }, table#5906 { ["itemType"] = table#5907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5009960", }, ["subjectLabel"] = table#5909 { ["type"] = "literal", ["value"] = "Orthogonal embeddings of graphs in Euclidean space", ["xml:lang"] = "en", }, }, table#5910 { ["itemType"] = table#5911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5009984", }, ["subjectLabel"] = table#5913 { ["type"] = "literal", ["value"] = "Domination number of the non-commuting graph of finite groups", ["xml:lang"] = "en", }, }, table#5914 { ["itemType"] = table#5915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5012365", }, ["subjectLabel"] = table#5917 { ["type"] = "literal", ["value"] = "Decomposition of complete bipartite graphs into cycles and stars with four edges", ["xml:lang"] = "en", }, }, table#5918 { ["itemType"] = table#5919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5012378", }, ["subjectLabel"] = table#5921 { ["type"] = "literal", ["value"] = "Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks", ["xml:lang"] = "en", }, }, table#5922 { ["itemType"] = table#5923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5016065", }, ["subjectLabel"] = table#5925 { ["type"] = "literal", ["value"] = "On the balanced domination of graphs", ["xml:lang"] = "en", }, }, table#5926 { ["itemType"] = table#5927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5020291", }, ["subjectLabel"] = table#5929 { ["type"] = "literal", ["value"] = "Trivalent dihedrants and bi-dihedrants", ["xml:lang"] = "en", }, }, table#5930 { ["itemType"] = table#5931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5023803", }, ["subjectLabel"] = table#5933 { ["type"] = "literal", ["value"] = "Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph", ["xml:lang"] = "en", }, }, table#5934 { ["itemType"] = table#5935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5024055", }, ["subjectLabel"] = table#5937 { ["type"] = "literal", ["value"] = "Initialization and Curing Policies for Pólya Contagion Networks", ["xml:lang"] = "en", }, }, table#5938 { ["itemType"] = table#5939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5025121", }, ["subjectLabel"] = table#5941 { ["type"] = "literal", ["value"] = "2-distance choice number of planar graphs with maximal degree no more than 4", ["xml:lang"] = "en", }, }, table#5942 { ["itemType"] = table#5943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5025144", }, ["subjectLabel"] = table#5945 { ["type"] = "literal", ["value"] = "Star chromatic number of Harary graphs", ["xml:lang"] = "en", }, }, table#5946 { ["itemType"] = table#5947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4956388", }, ["subjectLabel"] = table#5949 { ["type"] = "literal", ["value"] = "THE ZERO-DIVISOR GRAPH OF A MODULE", ["xml:lang"] = "en", }, }, table#5950 { ["itemType"] = table#5951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5027723", }, ["subjectLabel"] = table#5953 { ["type"] = "literal", ["value"] = "On ideal sumset labelled graphs", ["xml:lang"] = "en", }, }, table#5954 { ["itemType"] = table#5955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5027739", }, ["subjectLabel"] = table#5957 { ["type"] = "literal", ["value"] = "SD-Prime cordial labeling of alternate k-polygonal snake of various types", ["xml:lang"] = "en", }, }, table#5958 { ["itemType"] = table#5959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5028787", }, ["subjectLabel"] = table#5961 { ["type"] = "literal", ["value"] = "On the α-spectral radius of graphs", ["xml:lang"] = "en", }, }, table#5962 { ["itemType"] = table#5963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5028801", }, ["subjectLabel"] = table#5965 { ["type"] = "literal", ["value"] = "On hamiltonian decompositions of tensor products of graphs", ["xml:lang"] = "en", }, }, table#5966 { ["itemType"] = table#5967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5028804", }, ["subjectLabel"] = table#5969 { ["type"] = "literal", ["value"] = "Maximally and super connected multisplit graphs and digraphs", ["xml:lang"] = "en", }, }, table#5970 { ["itemType"] = table#5971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4957565", }, ["subjectLabel"] = table#5973 { ["type"] = "literal", ["value"] = "On the variable sum exdeg index and cut edges of graphs", ["xml:lang"] = "en", }, }, table#5974 { ["itemType"] = table#5975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5029975", }, ["subjectLabel"] = table#5977 { ["type"] = "literal", ["value"] = "On a conjecture of the harmonic index and the minimum degree of graphs", ["xml:lang"] = "en", }, }, table#5978 { ["itemType"] = table#5979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3696826", }, ["subjectLabel"] = table#5981 { ["type"] = "literal", ["value"] = "Network design and dynamic routing under queueing demand", ["xml:lang"] = "en", }, }, table#5982 { ["itemType"] = table#5983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3700690", }, ["subjectLabel"] = table#5985 { ["type"] = "literal", ["value"] = "Reordering a sparse matrix to a sparse blocked form", ["xml:lang"] = "en", }, }, table#5986 { ["itemType"] = table#5987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3702525", }, ["subjectLabel"] = table#5989 { ["type"] = "literal", ["value"] = "On Metapaths in Metagraphs", ["xml:lang"] = "en", }, }, table#5990 { ["itemType"] = table#5991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3703676", }, ["subjectLabel"] = table#5993 { ["type"] = "literal", ["value"] = "On finding spanning eulerian subgraphs", ["xml:lang"] = "en", }, }, table#5994 { ["itemType"] = table#5995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3708038", }, ["subjectLabel"] = table#5997 { ["type"] = "literal", ["value"] = "Edge‐disjoint spanning trees: A connectedness theorem", ["xml:lang"] = "en", }, }, table#5998 { ["itemType"] = table#5999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3708838", }, ["subjectLabel"] = table#6001 { ["type"] = "literal", ["value"] = "Shortness parameters for planar graphs with faces of only one type", ["xml:lang"] = "en", }, }, table#6002 { ["itemType"] = table#6003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3712105", }, ["subjectLabel"] = table#6005 { ["type"] = "literal", ["value"] = "Network reliability analysis using 2-connected digraph reductions", ["xml:lang"] = "en", }, }, table#6006 { ["itemType"] = table#6007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3714113", }, ["subjectLabel"] = table#6009 { ["type"] = "literal", ["value"] = "Factors and factorizations of graphs—a survey", ["xml:lang"] = "en", }, }, table#6010 { ["itemType"] = table#6011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3718757", }, ["subjectLabel"] = table#6013 { ["type"] = "literal", ["value"] = "Convexity in Graphs and Hypergraphs", ["xml:lang"] = "en", }, }, table#6014 { ["itemType"] = table#6015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3720636", }, ["subjectLabel"] = table#6017 { ["type"] = "literal", ["value"] = "Minimumk-hamiltonian graphs, II", ["xml:lang"] = "en", }, }, table#6018 { ["itemType"] = table#6019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3724370", }, ["subjectLabel"] = table#6021 { ["type"] = "literal", ["value"] = "Parity theorems for paths and cycles in graphs", ["xml:lang"] = "en", }, }, table#6022 { ["itemType"] = table#6023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3731636", }, ["subjectLabel"] = table#6025 { ["type"] = "literal", ["value"] = "Toughness and the existence ofk-factors", ["xml:lang"] = "en", }, }, table#6026 { ["itemType"] = table#6027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3734148", }, ["subjectLabel"] = table#6029 { ["type"] = "literal", ["value"] = "On an Invariant of Graphs and the Reliability Polynomial", ["xml:lang"] = "en", }, }, table#6030 { ["itemType"] = table#6031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3735724", }, ["subjectLabel"] = table#6033 { ["type"] = "literal", ["value"] = "A generalization of edge-coloring in graphs", ["xml:lang"] = "en", }, }, table#6034 { ["itemType"] = table#6035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3745872", }, ["subjectLabel"] = table#6037 { ["type"] = "literal", ["value"] = "What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?", ["xml:lang"] = "en", }, }, table#6038 { ["itemType"] = table#6039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3745873", }, ["subjectLabel"] = table#6041 { ["type"] = "literal", ["value"] = "Note on the reconstruction of vertex colored graphs", ["xml:lang"] = "en", }, }, table#6042 { ["itemType"] = table#6043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3745876", }, ["subjectLabel"] = table#6045 { ["type"] = "literal", ["value"] = "A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES", ["xml:lang"] = "en", }, }, table#6046 { ["itemType"] = table#6047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3745878", }, ["subjectLabel"] = table#6049 { ["type"] = "literal", ["value"] = "Bipartite density and the independence ratio", ["xml:lang"] = "en", }, }, table#6050 { ["itemType"] = table#6051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3864738", }, ["subjectLabel"] = table#6053 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3864738", }, }, table#6054 { ["itemType"] = table#6055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3748314", }, ["subjectLabel"] = table#6057 { ["type"] = "literal", ["value"] = "ALL GRAPHS ON A NON-PRIME NUMBER OF VERTICES ARE DESTRUCTIBLE", ["xml:lang"] = "en", }, }, table#6058 { ["itemType"] = table#6059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3749084", }, ["subjectLabel"] = table#6061 { ["type"] = "literal", ["value"] = "Largest bipartite subgraphs in triangle-free graphs with maximum degree three", ["xml:lang"] = "en", }, }, table#6062 { ["itemType"] = table#6063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3751595", }, ["subjectLabel"] = table#6065 { ["type"] = "literal", ["value"] = "Complexity of Finding Embeddings in a k-Tree", ["xml:lang"] = "en", }, }, table#6066 { ["itemType"] = table#6067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3768663", }, ["subjectLabel"] = table#6069 { ["type"] = "literal", ["value"] = "Counting almost minimum cutsets with reliability applications", ["xml:lang"] = "en", }, }, table#6070 { ["itemType"] = table#6071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3507648", }, ["subjectLabel"] = table#6073 { ["type"] = "literal", ["value"] = "The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases", ["xml:lang"] = "en", }, }, table#6074 { ["itemType"] = table#6075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3507650", }, ["subjectLabel"] = table#6077 { ["type"] = "literal", ["value"] = "Sufficient conditions for a graph to be super restricted edge-connected", ["xml:lang"] = "en", }, }, table#6078 { ["itemType"] = table#6079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3511369", }, ["subjectLabel"] = table#6081 { ["type"] = "literal", ["value"] = "Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities", ["xml:lang"] = "en", }, }, table#6082 { ["itemType"] = table#6083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3937421", }, ["subjectLabel"] = table#6085 { ["type"] = "literal", ["value"] = "On Connectivity in Matroids and Graphs", ["xml:lang"] = "en", }, }, table#6086 { ["itemType"] = table#6087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3512192", }, ["subjectLabel"] = table#6089 { ["type"] = "literal", ["value"] = "A generalization of a result of A. Rényi", ["xml:lang"] = "en", }, }, table#6090 { ["itemType"] = table#6091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3513864", }, ["subjectLabel"] = table#6093 { ["type"] = "literal", ["value"] = "A sufficient condition for Hamiltonian cycles in bipartite tournaments", ["xml:lang"] = "en", }, }, table#6094 { ["itemType"] = table#6095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3514863", }, ["subjectLabel"] = table#6097 { ["type"] = "literal", ["value"] = "NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS", ["xml:lang"] = "en", }, }, table#6098 { ["itemType"] = table#6099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3781773", }, ["subjectLabel"] = table#6101 { ["type"] = "literal", ["value"] = "Digraph Decompositions and Eulerian Systems", ["xml:lang"] = "en", }, }, table#6102 { ["itemType"] = table#6103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3783422", }, ["subjectLabel"] = table#6105 { ["type"] = "literal", ["value"] = "The Null Space Problem II. Algorithms", ["xml:lang"] = "en", }, }, table#6106 { ["itemType"] = table#6107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3787776", }, ["subjectLabel"] = table#6109 { ["type"] = "literal", ["value"] = "Improving reliability bounds in computer networks", ["xml:lang"] = "en", }, }, table#6110 { ["itemType"] = table#6111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3526044", }, ["subjectLabel"] = table#6113 { ["type"] = "literal", ["value"] = "Binding number and Hamiltonian (g, f)-factors in graphs II", ["xml:lang"] = "en", }, }, table#6114 { ["itemType"] = table#6115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3795703", }, ["subjectLabel"] = table#6117 { ["type"] = "literal", ["value"] = "A result on Hamiltonian line graphs involving restrictions on induced subgraphs", ["xml:lang"] = "en", }, }, table#6118 { ["itemType"] = table#6119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3795704", }, ["subjectLabel"] = table#6121 { ["type"] = "literal", ["value"] = "Two sufficient conditions for a 2-factor in a bipartite graph", ["xml:lang"] = "en", }, }, table#6122 { ["itemType"] = table#6123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3797231", }, ["subjectLabel"] = table#6125 { ["type"] = "literal", ["value"] = "On the Interval Number of a Triangulated Graph", ["xml:lang"] = "en", }, }, table#6126 { ["itemType"] = table#6127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3800073", }, ["subjectLabel"] = table#6129 { ["type"] = "literal", ["value"] = "Longest paths and cycles in bipartite oriented graphs", ["xml:lang"] = "en", }, }, table#6130 { ["itemType"] = table#6131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3539929", }, ["subjectLabel"] = table#6133 { ["type"] = "literal", ["value"] = "Vertex suppression in 3-connected graphs", ["xml:lang"] = "en", }, }, table#6134 { ["itemType"] = table#6135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3801588", }, ["subjectLabel"] = table#6137 { ["type"] = "literal", ["value"] = "Contractions and hamiltonian line graphs", ["xml:lang"] = "en", }, }, table#6138 { ["itemType"] = table#6139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3803150", }, ["subjectLabel"] = table#6141 { ["type"] = "literal", ["value"] = "3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian", ["xml:lang"] = "en", }, }, table#6142 { ["itemType"] = table#6143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3543511", }, ["subjectLabel"] = table#6145 { ["type"] = "literal", ["value"] = "The rupture degree of trees", ["xml:lang"] = "en", }, }, table#6146 { ["itemType"] = table#6147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3545667", }, ["subjectLabel"] = table#6149 { ["type"] = "literal", ["value"] = "Super-connected and hyper-connected jump graphs", ["xml:lang"] = "en", }, }, table#6150 { ["itemType"] = table#6151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3808126", }, ["subjectLabel"] = table#6153 { ["type"] = "literal", ["value"] = "A reduction method to find spanning Eulerian subgraphs", ["xml:lang"] = "en", }, }, table#6154 { ["itemType"] = table#6155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3697031", }, ["subjectLabel"] = table#6157 { ["type"] = "literal", ["value"] = "On Isometric Embeddings of Graphs", ["xml:lang"] = "en", }, }, table#6158 { ["itemType"] = table#6159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3812274", }, ["subjectLabel"] = table#6161 { ["type"] = "literal", ["value"] = "Existence of Δλ-cycles and Δλ-paths", ["xml:lang"] = "en", }, }, table#6162 { ["itemType"] = table#6163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3812275", }, ["subjectLabel"] = table#6165 { ["type"] = "literal", ["value"] = "Spanning trails", ["xml:lang"] = "en", }, }, table#6166 { ["itemType"] = table#6167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815321", }, ["subjectLabel"] = table#6169 { ["type"] = "literal", ["value"] = "Enumeration of cyclically 4-connected cubic graphs", ["xml:lang"] = "en", }, }, table#6170 { ["itemType"] = table#6171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815326", }, ["subjectLabel"] = table#6173 { ["type"] = "literal", ["value"] = "Longest cycles in 3-connected graphs contain three contractible edges", ["xml:lang"] = "en", }, }, table#6174 { ["itemType"] = table#6175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815339", }, ["subjectLabel"] = table#6177 { ["type"] = "literal", ["value"] = "On Stockmeyer's non-reconstructible tournaments", ["xml:lang"] = "en", }, }, table#6178 { ["itemType"] = table#6179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815341", }, ["subjectLabel"] = table#6181 { ["type"] = "literal", ["value"] = "Some conditions for the existence off-factors", ["xml:lang"] = "en", }, }, table#6182 { ["itemType"] = table#6183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815345", }, ["subjectLabel"] = table#6185 { ["type"] = "literal", ["value"] = "On superperfect noncomparability graphs", ["xml:lang"] = "en", }, }, table#6186 { ["itemType"] = table#6187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815346", }, ["subjectLabel"] = table#6189 { ["type"] = "literal", ["value"] = "ON α,β CYCLE-CONTRACTIBLE GRAPHS", ["xml:lang"] = "en", }, }, table#6190 { ["itemType"] = table#6191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3815893", }, ["subjectLabel"] = table#6193 { ["type"] = "literal", ["value"] = "Pursuit—Evasion games on graphs", ["xml:lang"] = "en", }, }, table#6194 { ["itemType"] = table#6195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3822186", }, ["subjectLabel"] = table#6197 { ["type"] = "literal", ["value"] = "Edge-colored saturated graphs", ["xml:lang"] = "en", }, }, table#6198 { ["itemType"] = table#6199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3824445", }, ["subjectLabel"] = table#6201 { ["type"] = "literal", ["value"] = "An 11-vertex theorem for 3-connected cubic graphs", ["xml:lang"] = "en", }, }, table#6202 { ["itemType"] = table#6203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3564624", }, ["subjectLabel"] = table#6205 { ["type"] = "literal", ["value"] = "A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH", ["xml:lang"] = "en", }, }, table#6206 { ["itemType"] = table#6207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3564912", }, ["subjectLabel"] = table#6209 { ["type"] = "literal", ["value"] = "NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS", ["xml:lang"] = "en", }, }, table#6210 { ["itemType"] = table#6211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3568414", }, ["subjectLabel"] = table#6213 { ["type"] = "literal", ["value"] = "On the adjacent vertex distinguishing edge colourings of graphs", ["xml:lang"] = "en", }, }, table#6214 { ["itemType"] = table#6215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3831041", }, ["subjectLabel"] = table#6217 { ["type"] = "literal", ["value"] = "Edge disjoint cycles in graphs", ["xml:lang"] = "en", }, }, table#6218 { ["itemType"] = table#6219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3833885", }, ["subjectLabel"] = table#6221 { ["type"] = "literal", ["value"] = "On the separation number of a graph", ["xml:lang"] = "en", }, }, table#6222 { ["itemType"] = table#6223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3575370", }, ["subjectLabel"] = table#6225 { ["type"] = "literal", ["value"] = "ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS", ["xml:lang"] = "en", }, }, table#6226 { ["itemType"] = table#6227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3575371", }, ["subjectLabel"] = table#6229 { ["type"] = "literal", ["value"] = "MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS", ["xml:lang"] = "en", }, }, table#6230 { ["itemType"] = table#6231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3835473", }, ["subjectLabel"] = table#6233 { ["type"] = "literal", ["value"] = "Decompositions of graphs into trees", ["xml:lang"] = "en", }, }, table#6234 { ["itemType"] = table#6235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3836208", }, ["subjectLabel"] = table#6237 { ["type"] = "literal", ["value"] = "Generalized matrix tree theorem for mixed graphs", ["xml:lang"] = "en", }, }, table#6238 { ["itemType"] = table#6239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3577029", }, ["subjectLabel"] = table#6241 { ["type"] = "literal", ["value"] = "Links and cubic 3-polytopes", ["xml:lang"] = "en", }, }, table#6242 { ["itemType"] = table#6243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3578240", }, ["subjectLabel"] = table#6245 { ["type"] = "literal", ["value"] = "Graph of a Nearring with Respect to an Ideal", ["xml:lang"] = "en", }, }, table#6246 { ["itemType"] = table#6247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3852199", }, ["subjectLabel"] = table#6249 { ["type"] = "literal", ["value"] = "On the chromatic number of binary matroids", ["xml:lang"] = "en", }, }, table#6250 { ["itemType"] = table#6251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3594953", }, ["subjectLabel"] = table#6253 { ["type"] = "literal", ["value"] = "Packingk-edge trees in graphs of restricted vertex degrees", ["xml:lang"] = "en", }, }, table#6254 { ["itemType"] = table#6255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3603584", }, ["subjectLabel"] = table#6257 { ["type"] = "literal", ["value"] = "Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks", ["xml:lang"] = "en", }, }, table#6258 { ["itemType"] = table#6259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3869373", }, ["subjectLabel"] = table#6261 { ["type"] = "literal", ["value"] = "Genus of cartesian products of regular bipartite graphs", ["xml:lang"] = "en", }, }, table#6262 { ["itemType"] = table#6263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3621979", }, ["subjectLabel"] = table#6265 { ["type"] = "literal", ["value"] = "Hamiltonicity in Partly claw-free graphs", ["xml:lang"] = "en", }, }, table#6266 { ["itemType"] = table#6267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3628471", }, ["subjectLabel"] = table#6269 { ["type"] = "literal", ["value"] = "Efficient Parallel Routing Algorithms for Cartesian and Composition Networks", ["xml:lang"] = "en", }, }, table#6270 { ["itemType"] = table#6271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3628472", }, ["subjectLabel"] = table#6273 { ["type"] = "literal", ["value"] = "Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks", ["xml:lang"] = "en", }, }, table#6274 { ["itemType"] = table#6275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3893952", }, ["subjectLabel"] = table#6277 { ["type"] = "literal", ["value"] = "-constructibility of planar graphs", ["xml:lang"] = "en", }, }, table#6278 { ["itemType"] = table#6279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3630029", }, ["subjectLabel"] = table#6281 { ["type"] = "literal", ["value"] = "A note on the lower bound of edge guards of polyhedral terrains", ["xml:lang"] = "en", }, }, table#6282 { ["itemType"] = table#6283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3630834", }, ["subjectLabel"] = table#6285 { ["type"] = "literal", ["value"] = "Decompositions of highly connected graphs into paths of length 3", ["xml:lang"] = "en", }, }, table#6286 { ["itemType"] = table#6287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3630835", }, ["subjectLabel"] = table#6289 { ["type"] = "literal", ["value"] = "Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord", ["xml:lang"] = "en", }, }, table#6290 { ["itemType"] = table#6291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3632967", }, ["subjectLabel"] = table#6293 { ["type"] = "literal", ["value"] = "The computational complexity of graph contractions II: Two tough polynomially solvable cases", ["xml:lang"] = "en", }, }, table#6294 { ["itemType"] = table#6295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3633017", }, ["subjectLabel"] = table#6297 { ["type"] = "literal", ["value"] = "Multiple choice tries and distributed hash tables", ["xml:lang"] = "en", }, }, table#6298 { ["itemType"] = table#6299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3904633", }, ["subjectLabel"] = table#6301 { ["type"] = "literal", ["value"] = "On certain cycles in graphs", ["xml:lang"] = "en", }, }, table#6302 { ["itemType"] = table#6303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3910010", }, ["subjectLabel"] = table#6305 { ["type"] = "literal", ["value"] = "On testing isomorphism of permutation graphs", ["xml:lang"] = "en", }, }, table#6306 { ["itemType"] = table#6307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3646211", }, ["subjectLabel"] = table#6309 { ["type"] = "literal", ["value"] = "THE RAMSEY NUMBERS FOR STARS OF ODD ORDER VERSUS A WHEEL OF ORDER NINE", ["xml:lang"] = "en", }, }, table#6310 { ["itemType"] = table#6311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3912823", }, ["subjectLabel"] = table#6313 { ["type"] = "literal", ["value"] = "On r-regular r-connected non-hamiltonian graphs", ["xml:lang"] = "en", }, }, table#6314 { ["itemType"] = table#6315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3652543", }, ["subjectLabel"] = table#6317 { ["type"] = "literal", ["value"] = "Rainbow faces in edge‐colored plane graphs", ["xml:lang"] = "en", }, }, table#6318 { ["itemType"] = table#6319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3652544", }, ["subjectLabel"] = table#6321 { ["type"] = "literal", ["value"] = "Cycle‐minors and subdivisions of wheels", ["xml:lang"] = "en", }, }, table#6322 { ["itemType"] = table#6323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3654793", }, ["subjectLabel"] = table#6325 { ["type"] = "literal", ["value"] = "Percolation in quantum computation and", ["xml:lang"] = "en", }, }, table#6326 { ["itemType"] = table#6327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3920654", }, ["subjectLabel"] = table#6329 { ["type"] = "literal", ["value"] = "COST AUTOMATA, OPTIMALITY AND TOLERANCE", ["xml:lang"] = "en", }, }, table#6330 { ["itemType"] = table#6331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3655768", }, ["subjectLabel"] = table#6333 { ["type"] = "literal", ["value"] = "A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS", ["xml:lang"] = "en", }, }, table#6334 { ["itemType"] = table#6335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3656801", }, ["subjectLabel"] = table#6337 { ["type"] = "literal", ["value"] = "A Kind of Graph Structure on Non-reduced Rings", ["xml:lang"] = "en", }, }, table#6338 { ["itemType"] = table#6339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3656866", }, ["subjectLabel"] = table#6341 { ["type"] = "literal", ["value"] = "Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor", ["xml:lang"] = "en", }, }, table#6342 { ["itemType"] = table#6343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3807216", }, ["subjectLabel"] = table#6345 { ["type"] = "literal", ["value"] = "Differential Posets", ["xml:lang"] = "en", }, }, table#6346 { ["itemType"] = table#6347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3927265", }, ["subjectLabel"] = table#6349 { ["type"] = "literal", ["value"] = "On a matroid generalization of graph connectivity", ["xml:lang"] = "en", }, }, table#6350 { ["itemType"] = table#6351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3774806", }, ["subjectLabel"] = table#6353 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3774806", }, }, table#6354 { ["itemType"] = table#6355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3816723", }, ["subjectLabel"] = table#6357 { ["type"] = "literal", ["value"] = "Tutte Polynomials and Link Polynomials", ["xml:lang"] = "en", }, }, table#6358 { ["itemType"] = table#6359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3936214", }, ["subjectLabel"] = table#6361 { ["type"] = "literal", ["value"] = "Linear time transformations between combinatorial problems", ["xml:lang"] = "en", }, }, table#6362 { ["itemType"] = table#6363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3937423", }, ["subjectLabel"] = table#6365 { ["type"] = "literal", ["value"] = "Kuratowski's theorem", ["xml:lang"] = "en", }, }, table#6366 { ["itemType"] = table#6367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3675933", }, ["subjectLabel"] = table#6369 { ["type"] = "literal", ["value"] = "The traveling salesman problem on a graph and some related integer polyhedra", ["xml:lang"] = "en", }, }, table#6370 { ["itemType"] = table#6371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3684158", }, ["subjectLabel"] = table#6373 { ["type"] = "literal", ["value"] = "ON STABLE GRAPHS", ["xml:lang"] = "en", }, }, table#6374 { ["itemType"] = table#6375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3689208", }, ["subjectLabel"] = table#6377 { ["type"] = "literal", ["value"] = "Ranking the Vertices of a Paired Comparison Digraph", ["xml:lang"] = "en", }, }, table#6378 { ["itemType"] = table#6379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926033", }, ["subjectLabel"] = table#6381 { ["type"] = "literal", ["value"] = "Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \$d\$", ["xml:lang"] = "en", }, }, table#6382 { ["itemType"] = table#6383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926044", }, ["subjectLabel"] = table#6385 { ["type"] = "literal", ["value"] = "Minimum size of \$n\$-factor-critical graphs and \$k\$-extendable graphs", ["xml:lang"] = "en", }, }, table#6386 { ["itemType"] = table#6387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926050", }, ["subjectLabel"] = table#6389 { ["type"] = "literal", ["value"] = "\$s\$-vertex pancyclic index", ["xml:lang"] = "en", }, }, table#6390 { ["itemType"] = table#6391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926056", }, ["subjectLabel"] = table#6393 { ["type"] = "literal", ["value"] = "Super connectivity and super edge connectivity of the Mycielskian of a graph", ["xml:lang"] = "en", }, }, table#6394 { ["itemType"] = table#6395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1926062", }, ["subjectLabel"] = table#6397 { ["type"] = "literal", ["value"] = "Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs", ["xml:lang"] = "en", }, }, table#6398 { ["itemType"] = table#6399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1928128", }, ["subjectLabel"] = table#6401 { ["type"] = "literal", ["value"] = "The smallest values of algebraic connectivity for trees", ["xml:lang"] = "en", }, }, table#6402 { ["itemType"] = table#6403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1928146", }, ["subjectLabel"] = table#6405 { ["type"] = "literal", ["value"] = "A note on \$Z_3\$-connected graphs with degree sum condition", ["xml:lang"] = "en", }, }, table#6406 { ["itemType"] = table#6407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1928288", }, ["subjectLabel"] = table#6409 { ["type"] = "literal", ["value"] = "Graph equation for line graphs and \$m\$-step graphs", ["xml:lang"] = "en", }, }, table#6410 { ["itemType"] = table#6411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1928290", }, ["subjectLabel"] = table#6413 { ["type"] = "literal", ["value"] = "A note on heterochromatic \$C_4\$ in edge-colored triangle-free graphs", ["xml:lang"] = "en", }, }, table#6414 { ["itemType"] = table#6415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1935605", }, ["subjectLabel"] = table#6417 { ["type"] = "literal", ["value"] = "The structure of plane graphs with independent crossings and its applications to coloring problems", ["xml:lang"] = "en", }, }, table#6418 { ["itemType"] = table#6419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1935988", }, ["subjectLabel"] = table#6421 { ["type"] = "literal", ["value"] = "Two sufficient conditions for Hamilton and dominating cycles", ["xml:lang"] = "en", }, }, table#6422 { ["itemType"] = table#6423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1938665", }, ["subjectLabel"] = table#6425 { ["type"] = "literal", ["value"] = "Bicyclic graphs with small positive index of inertia", ["xml:lang"] = "en", }, }, table#6426 { ["itemType"] = table#6427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1942183", }, ["subjectLabel"] = table#6429 { ["type"] = "literal", ["value"] = "A vertex cover with chorded 4-cycles", ["xml:lang"] = "en", }, }, table#6430 { ["itemType"] = table#6431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1944218", }, ["subjectLabel"] = table#6433 { ["type"] = "literal", ["value"] = "Characterization of minimally \$(2,l)\$-connected graphs", ["xml:lang"] = "en", }, }, table#6434 { ["itemType"] = table#6435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1945586", }, ["subjectLabel"] = table#6437 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows in matroid base graph", ["xml:lang"] = "en", }, }, table#6438 { ["itemType"] = table#6439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1945962", }, ["subjectLabel"] = table#6441 { ["type"] = "literal", ["value"] = "Chromaticity of complete 6-partite graphs with certain star or matching deleted. II", ["xml:lang"] = "en", }, }, table#6442 { ["itemType"] = table#6443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1949093", }, ["subjectLabel"] = table#6445 { ["type"] = "literal", ["value"] = "On the \$L(2,1)\$-labelings of amalgamations of graphs", ["xml:lang"] = "en", }, }, table#6446 { ["itemType"] = table#6447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1949119", }, ["subjectLabel"] = table#6449 { ["type"] = "literal", ["value"] = "(2)-pancyclic graphs", ["xml:lang"] = "en", }, }, table#6450 { ["itemType"] = table#6451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1950399", }, ["subjectLabel"] = table#6453 { ["type"] = "literal", ["value"] = "Decomposition of complete graphs into cycles and stars", ["xml:lang"] = "en", }, }, table#6454 { ["itemType"] = table#6455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1950407", }, ["subjectLabel"] = table#6457 { ["type"] = "literal", ["value"] = "Spanning Eulerian subgraphs of 2-edge-connected graphs", ["xml:lang"] = "en", }, }, table#6458 { ["itemType"] = table#6459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1951220", }, ["subjectLabel"] = table#6461 { ["type"] = "literal", ["value"] = "Codes from incidence matrices of graphs", ["xml:lang"] = "en", }, }, table#6462 { ["itemType"] = table#6463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1952508", }, ["subjectLabel"] = table#6465 { ["type"] = "literal", ["value"] = "Triangle-free graphs with large independent domination number", ["xml:lang"] = "en", }, }, table#6466 { ["itemType"] = table#6467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1952726", }, ["subjectLabel"] = table#6469 { ["type"] = "literal", ["value"] = "Disconnected forbidden subgraphs, toughness and Hamilton cycles", ["xml:lang"] = "en", }, }, table#6470 { ["itemType"] = table#6471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1959708", }, ["subjectLabel"] = table#6473 { ["type"] = "literal", ["value"] = "The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs", ["xml:lang"] = "en", }, }, table#6474 { ["itemType"] = table#6475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1959715", }, ["subjectLabel"] = table#6477 { ["type"] = "literal", ["value"] = "A characterization of \$3\$-\$(\\gamma _{c}, 2)\$-critical claw-free graphs which are not \$3\$-\$\\gamma _{c }\$-critical", ["xml:lang"] = "en", }, }, table#6478 { ["itemType"] = table#6479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1959719", }, ["subjectLabel"] = table#6481 { ["type"] = "literal", ["value"] = "Toughness and matching extension in \${\\mathcal{P}_3}\$-dominated graphs", ["xml:lang"] = "en", }, }, table#6482 { ["itemType"] = table#6483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1962020", }, ["subjectLabel"] = table#6485 { ["type"] = "literal", ["value"] = "Naturally submodular digraphs and forbidden digraph configurations", ["xml:lang"] = "en", }, }, table#6486 { ["itemType"] = table#6487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1962050", }, ["subjectLabel"] = table#6489 { ["type"] = "literal", ["value"] = "Recognition and isomorphism of tree-like \$P_4\$-connected graphs", ["xml:lang"] = "en", }, }, table#6490 { ["itemType"] = table#6491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1962051", }, ["subjectLabel"] = table#6493 { ["type"] = "literal", ["value"] = "Not every 2-tough graph is Hamiltonian", ["xml:lang"] = "en", }, }, table#6494 { ["itemType"] = table#6495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1970755", }, ["subjectLabel"] = table#6497 { ["type"] = "literal", ["value"] = "A class of Hamiltonian and edge symmetric Cayley graphs on symmetric groups", ["xml:lang"] = "en", }, }, table#6498 { ["itemType"] = table#6499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1976446", }, ["subjectLabel"] = table#6501 { ["type"] = "literal", ["value"] = "Degree conditions of induced matching extendable graphs", ["xml:lang"] = "en", }, }, table#6502 { ["itemType"] = table#6503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1981630", }, ["subjectLabel"] = table#6505 { ["type"] = "literal", ["value"] = "Improved distributed \$\\Delta\$-coloring", ["xml:lang"] = "en", }, }, table#6506 { ["itemType"] = table#6507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1983428", }, ["subjectLabel"] = table#6509 { ["type"] = "literal", ["value"] = "The calculations of topological indices on certain networks", ["xml:lang"] = "en", }, }, table#6510 { ["itemType"] = table#6511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1985938", }, ["subjectLabel"] = table#6513 { ["type"] = "literal", ["value"] = "On tetravalent vertex-transitive bi-circulants", ["xml:lang"] = "en", }, }, table#6514 { ["itemType"] = table#6515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1987231", }, ["subjectLabel"] = table#6517 { ["type"] = "literal", ["value"] = "Symmetrically connected and antisymmetrically connected \$T_0\$-quasi-metric extensions", ["xml:lang"] = "en", }, }, table#6518 { ["itemType"] = table#6519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1987561", }, ["subjectLabel"] = table#6521 { ["type"] = "literal", ["value"] = "Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \$k\$ vertices", ["xml:lang"] = "en", }, }, table#6522 { ["itemType"] = table#6523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1987570", }, ["subjectLabel"] = table#6525 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total coloring of triangle free IC-planar graphs", ["xml:lang"] = "en", }, }, table#6526 { ["itemType"] = table#6527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1988458", }, ["subjectLabel"] = table#6529 { ["type"] = "literal", ["value"] = "Some new coincidence point results for single-valued and multi-valued mappings in \$b\$-metric spaces via digraphs", ["xml:lang"] = "en", }, }, table#6530 { ["itemType"] = table#6531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1988569", }, ["subjectLabel"] = table#6533 { ["type"] = "literal", ["value"] = "Spanning 5-ended trees in \$K_{1,5}\$-free graphs", ["xml:lang"] = "en", }, }, table#6534 { ["itemType"] = table#6535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1989180", }, ["subjectLabel"] = table#6537 { ["type"] = "literal", ["value"] = "A spectral method for bipartizing a network and detecting a large anti-community", ["xml:lang"] = "en", }, }, table#6538 { ["itemType"] = table#6539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1990360", }, ["subjectLabel"] = table#6541 { ["type"] = "literal", ["value"] = "Pack graphs with subgraphs of size three", ["xml:lang"] = "en", }, }, table#6542 { ["itemType"] = table#6543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1990394", }, ["subjectLabel"] = table#6545 { ["type"] = "literal", ["value"] = "Distance eigenvalues and forwarding indices of circulants", ["xml:lang"] = "en", }, }, table#6546 { ["itemType"] = table#6547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1999570", }, ["subjectLabel"] = table#6549 { ["type"] = "literal", ["value"] = "A fast attribute reduction method for large formal decision contexts", ["xml:lang"] = "en", }, }, table#6550 { ["itemType"] = table#6551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1999744", }, ["subjectLabel"] = table#6553 { ["type"] = "literal", ["value"] = "On the \$(3, 1)\$-choosability of planar graphs without adjacent cycles of length \$5, 6, 7\$", ["xml:lang"] = "en", }, }, table#6554 { ["itemType"] = table#6555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1999747", }, ["subjectLabel"] = table#6557 { ["type"] = "literal", ["value"] = "Hexavalent half-arc-transitive graphs of order \$9 p\$", ["xml:lang"] = "en", }, }, table#6558 { ["itemType"] = table#6559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1999751", }, ["subjectLabel"] = table#6561 { ["type"] = "literal", ["value"] = "On incidence choosability of cubic graphs", ["xml:lang"] = "en", }, }, table#6562 { ["itemType"] = table#6563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2000562", }, ["subjectLabel"] = table#6565 { ["type"] = "literal", ["value"] = "A structure of 1-planar graph and its applications to coloring problems", ["xml:lang"] = "en", }, }, table#6566 { ["itemType"] = table#6567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2000569", }, ["subjectLabel"] = table#6569 { ["type"] = "literal", ["value"] = "The cyclic edge-connectivity of strongly regular graphs", ["xml:lang"] = "en", }, }, table#6570 { ["itemType"] = table#6571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2000574", }, ["subjectLabel"] = table#6573 { ["type"] = "literal", ["value"] = "Hamiltonian spectra of graphs", ["xml:lang"] = "en", }, }, table#6574 { ["itemType"] = table#6575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2000928", }, ["subjectLabel"] = table#6577 { ["type"] = "literal", ["value"] = "A formula with its applications on the difference of Zagreb indices of graphs", ["xml:lang"] = "en", }, }, table#6578 { ["itemType"] = table#6579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2002687", }, ["subjectLabel"] = table#6581 { ["type"] = "literal", ["value"] = "On the spectrum of an equitable quotient matrix and its application", ["xml:lang"] = "en", }, }, table#6582 { ["itemType"] = table#6583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2002706", }, ["subjectLabel"] = table#6585 { ["type"] = "literal", ["value"] = "The generalized distance matrix of digraphs", ["xml:lang"] = "en", }, }, table#6586 { ["itemType"] = table#6587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2004157", }, ["subjectLabel"] = table#6589 { ["type"] = "literal", ["value"] = "On variable sum exdeg indices of quasi-tree graphs and unicyclic graphs", ["xml:lang"] = "en", }, }, table#6590 { ["itemType"] = table#6591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2005705", }, ["subjectLabel"] = table#6593 { ["type"] = "literal", ["value"] = "Vertex-disjoint rainbow triangles in edge-colored graphs", ["xml:lang"] = "en", }, }, table#6594 { ["itemType"] = table#6595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2007661", }, ["subjectLabel"] = table#6597 { ["type"] = "literal", ["value"] = "On the spectral radius and energy of the weighted adjacency matrix of a graph", ["xml:lang"] = "en", }, }, table#6598 { ["itemType"] = table#6599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2007806", }, ["subjectLabel"] = table#6601 { ["type"] = "literal", ["value"] = "Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \$k\$-partiteness", ["xml:lang"] = "en", }, }, table#6602 { ["itemType"] = table#6603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2008493", }, ["subjectLabel"] = table#6605 { ["type"] = "literal", ["value"] = "New formulae for the bipartite vertex frustration and decycling number of graphs", ["xml:lang"] = "en", }, }, table#6606 { ["itemType"] = table#6607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2009345", }, ["subjectLabel"] = table#6609 { ["type"] = "literal", ["value"] = "The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs", ["xml:lang"] = "en", }, }, table#6610 { ["itemType"] = table#6611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2010690", }, ["subjectLabel"] = table#6613 { ["type"] = "literal", ["value"] = "Minimum degree and size conditions for the proper connection number of graphs", ["xml:lang"] = "en", }, }, table#6614 { ["itemType"] = table#6615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2010717", }, ["subjectLabel"] = table#6617 { ["type"] = "literal", ["value"] = "Connectivity of the graph induced by contractible edges of a \$k\$-tree", ["xml:lang"] = "en", }, }, table#6618 { ["itemType"] = table#6619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2010728", }, ["subjectLabel"] = table#6621 { ["type"] = "literal", ["value"] = "Graphic sequences with a realization containing cycles \$C_3, \\dots, C_\\ell \$", ["xml:lang"] = "en", }, }, table#6622 { ["itemType"] = table#6623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2012788", }, ["subjectLabel"] = table#6625 { ["type"] = "literal", ["value"] = "The multiagent planning problem", ["xml:lang"] = "en", }, }, table#6626 { ["itemType"] = table#6627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2012896", }, ["subjectLabel"] = table#6629 { ["type"] = "literal", ["value"] = "The (vertex-)monochromatic index of a graph", ["xml:lang"] = "en", }, }, table#6630 { ["itemType"] = table#6631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2013047", }, ["subjectLabel"] = table#6633 { ["type"] = "literal", ["value"] = "Generalized competition index of primitive digraphs", ["xml:lang"] = "en", }, }, table#6634 { ["itemType"] = table#6635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2013125", }, ["subjectLabel"] = table#6637 { ["type"] = "literal", ["value"] = "Linear arboricity of regular digraphs", ["xml:lang"] = "en", }, }, table#6638 { ["itemType"] = table#6639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2014721", }, ["subjectLabel"] = table#6641 { ["type"] = "literal", ["value"] = "Fractional \$f\$-edge cover chromatic index of graphs", ["xml:lang"] = "en", }, }, table#6642 { ["itemType"] = table#6643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2014729", }, ["subjectLabel"] = table#6645 { ["type"] = "literal", ["value"] = "The Chvátal-Erdős condition for group connectivity in graphs", ["xml:lang"] = "en", }, }, table#6646 { ["itemType"] = table#6647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2014742", }, ["subjectLabel"] = table#6649 { ["type"] = "literal", ["value"] = "Symmetric bimonoidal intermuting categories and \$\\omega\\times\\omega\$ reduced bar constructions", ["xml:lang"] = "en", }, }, table#6650 { ["itemType"] = table#6651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2017055", }, ["subjectLabel"] = table#6653 { ["type"] = "literal", ["value"] = "On the AVDTC of 4-regular graphs", ["xml:lang"] = "en", }, }, table#6654 { ["itemType"] = table#6655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2017199", }, ["subjectLabel"] = table#6657 { ["type"] = "literal", ["value"] = "A formula for all minors of the adjacency matrix and an application", ["xml:lang"] = "en", }, }, table#6658 { ["itemType"] = table#6659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2017585", }, ["subjectLabel"] = table#6661 { ["type"] = "literal", ["value"] = "On the adjacent eccentric distance sum of graphs", ["xml:lang"] = "en", }, }, table#6662 { ["itemType"] = table#6663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2017586", }, ["subjectLabel"] = table#6665 { ["type"] = "literal", ["value"] = "On path-quasar Ramsey numbers", ["xml:lang"] = "en", }, }, table#6666 { ["itemType"] = table#6667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2021684", }, ["subjectLabel"] = table#6669 { ["type"] = "literal", ["value"] = "Some results about the reliability of folded hypercubes", ["xml:lang"] = "en", }, }, table#6670 { ["itemType"] = table#6671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2022508", }, ["subjectLabel"] = table#6673 { ["type"] = "literal", ["value"] = "Least \$Q\$-eigenvalues of nonbipartite 2-connected graphs", ["xml:lang"] = "en", }, }, table#6674 { ["itemType"] = table#6675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2022514", }, ["subjectLabel"] = table#6677 { ["type"] = "literal", ["value"] = "Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs", ["xml:lang"] = "en", }, }, table#6678 { ["itemType"] = table#6679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2023729", }, ["subjectLabel"] = table#6681 { ["type"] = "literal", ["value"] = "Acyclic edge coloring of IC-planar graphs", ["xml:lang"] = "en", }, }, table#6682 { ["itemType"] = table#6683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2023732", }, ["subjectLabel"] = table#6685 { ["type"] = "literal", ["value"] = "A generalization of implicit Ore-condition for Hamiltonicity of \$k\$-connected graphs", ["xml:lang"] = "en", }, }, table#6686 { ["itemType"] = table#6687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2024393", }, ["subjectLabel"] = table#6689 { ["type"] = "literal", ["value"] = "Yang-Baxter equation in median algebras", ["xml:lang"] = "en", }, }, table#6690 { ["itemType"] = table#6691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2025183", }, ["subjectLabel"] = table#6693 { ["type"] = "literal", ["value"] = "The number of circles of a maximum state of a plane graph with applications", ["xml:lang"] = "en", }, }, table#6694 { ["itemType"] = table#6695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2025212", }, ["subjectLabel"] = table#6697 { ["type"] = "literal", ["value"] = "A new lower bound on the potential-Ramsey number of two graphs", ["xml:lang"] = "en", }, }, table#6698 { ["itemType"] = table#6699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2025382", }, ["subjectLabel"] = table#6701 { ["type"] = "literal", ["value"] = "New optimal error-correcting codes for crosstalk avoidance in on-chip data buses", ["xml:lang"] = "en", }, }, table#6702 { ["itemType"] = table#6703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2028068", }, ["subjectLabel"] = table#6705 { ["type"] = "literal", ["value"] = "On a conjecture for the university timetabling problem", ["xml:lang"] = "en", }, }, table#6706 { ["itemType"] = table#6707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2029604", }, ["subjectLabel"] = table#6709 { ["type"] = "literal", ["value"] = "A simplicial complex model for dynamic epistemic logic to study distributed task computability", ["xml:lang"] = "en", }, }, table#6710 { ["itemType"] = table#6711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2030437", }, ["subjectLabel"] = table#6713 { ["type"] = "literal", ["value"] = "Wiener index, Harary index and graph properties", ["xml:lang"] = "en", }, }, table#6714 { ["itemType"] = table#6715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2032732", }, ["subjectLabel"] = table#6717 { ["type"] = "literal", ["value"] = "Minimum embedding of any Steiner triple system into a 3-sun system via matchings", ["xml:lang"] = "en", }, }, table#6718 { ["itemType"] = table#6719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2033918", }, ["subjectLabel"] = table#6721 { ["type"] = "literal", ["value"] = "A solution of Li-Xia's problem on \$s\$-arc-transitive solvable Cayley graphs", ["xml:lang"] = "en", }, }, table#6722 { ["itemType"] = table#6723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2033994", }, ["subjectLabel"] = table#6725 { ["type"] = "literal", ["value"] = "Linear arboricity of outer-1-planar graphs", ["xml:lang"] = "en", }, }, table#6726 { ["itemType"] = table#6727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2034522", }, ["subjectLabel"] = table#6729 { ["type"] = "literal", ["value"] = "The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four", ["xml:lang"] = "en", }, }, table#6730 { ["itemType"] = table#6731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2034619", }, ["subjectLabel"] = table#6733 { ["type"] = "literal", ["value"] = "On distance in some finite planes and graphs arising from those planes", ["xml:lang"] = "en", }, }, table#6734 { ["itemType"] = table#6735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2034788", }, ["subjectLabel"] = table#6737 { ["type"] = "literal", ["value"] = "Vertex-pancyclicity of the \$(n,k)\$-bubble-sort networks", ["xml:lang"] = "en", }, }, table#6738 { ["itemType"] = table#6739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036021", }, ["subjectLabel"] = table#6741 { ["type"] = "literal", ["value"] = "Hamiltonicity of \$3_t\$EC graphs with \$\\alpha=\\kappa +1\$", ["xml:lang"] = "en", }, }, table#6742 { ["itemType"] = table#6743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036529", }, ["subjectLabel"] = table#6745 { ["type"] = "literal", ["value"] = "2-quasitotal fuzzy graphs and their total coloring", ["xml:lang"] = "en", }, }, table#6746 { ["itemType"] = table#6747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2038885", }, ["subjectLabel"] = table#6749 { ["type"] = "literal", ["value"] = "Lambda number of the power graph of a finite group", ["xml:lang"] = "en", }, }, table#6750 { ["itemType"] = table#6751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2038934", }, ["subjectLabel"] = table#6753 { ["type"] = "literal", ["value"] = "Induced \$H\$-packing \$k\$-partition problem in certain carbon based nanostructures", ["xml:lang"] = "en", }, }, table#6754 { ["itemType"] = table#6755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2039700", }, ["subjectLabel"] = table#6757 { ["type"] = "literal", ["value"] = "Edge-face list coloring of Halin graphs", ["xml:lang"] = "en", }, }, table#6758 { ["itemType"] = table#6759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2039710", }, ["subjectLabel"] = table#6761 { ["type"] = "literal", ["value"] = "The list \$L(2,1)\$-labeling of planar graphs with large girth", ["xml:lang"] = "en", }, }, table#6762 { ["itemType"] = table#6763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2042281", }, ["subjectLabel"] = table#6765 { ["type"] = "literal", ["value"] = "Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles", ["xml:lang"] = "en", }, }, table#6766 { ["itemType"] = table#6767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2042610", }, ["subjectLabel"] = table#6769 { ["type"] = "literal", ["value"] = "Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten", ["xml:lang"] = "en", }, }, table#6770 { ["itemType"] = table#6771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2043362", }, ["subjectLabel"] = table#6773 { ["type"] = "literal", ["value"] = "Proof of a conjecture on the strong chromatic index of Halin graphs", ["xml:lang"] = "en", }, }, table#6774 { ["itemType"] = table#6775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2045049", }, ["subjectLabel"] = table#6777 { ["type"] = "literal", ["value"] = "Efficient algorithms for support path with time constraint", ["xml:lang"] = "en", }, }, table#6778 { ["itemType"] = table#6779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069792", }, ["subjectLabel"] = table#6781 { ["type"] = "literal", ["value"] = "Theb-chromatic number of certain graphs and digraphs", ["xml:lang"] = "en", }, }, table#6782 { ["itemType"] = table#6783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069896", }, ["subjectLabel"] = table#6785 { ["type"] = "literal", ["value"] = "The first zagreb index and some hamiltonian properties of the line graph of a graph", ["xml:lang"] = "en", }, }, table#6786 { ["itemType"] = table#6787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069927", }, ["subjectLabel"] = table#6789 { ["type"] = "literal", ["value"] = "New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory", ["xml:lang"] = "en", }, }, table#6790 { ["itemType"] = table#6791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5069984", }, ["subjectLabel"] = table#6793 { ["type"] = "literal", ["value"] = "(2,1)-total labelling of planar graphs with large maximum degree", ["xml:lang"] = "en", }, }, table#6794 { ["itemType"] = table#6795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5070550", }, ["subjectLabel"] = table#6797 { ["type"] = "literal", ["value"] = "The minimality of the Georges–Kelmans graph", ["xml:lang"] = "en", }, }, table#6798 { ["itemType"] = table#6799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5073311", }, ["subjectLabel"] = table#6801 { ["type"] = "literal", ["value"] = "Zero-divisor graph of semisimple group-rings", ["xml:lang"] = "en", }, }, table#6802 { ["itemType"] = table#6803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5073760", }, ["subjectLabel"] = table#6805 { ["type"] = "literal", ["value"] = "Exponential Convergence Towards Consensus for Non-Symmetric Linear First-Order Systems in Finite and Infinite Dimensions", ["xml:lang"] = "en", }, }, table#6806 { ["itemType"] = table#6807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5073767", }, ["subjectLabel"] = table#6809 { ["type"] = "literal", ["value"] = "On the genus of non-zero component union graphs of vector spaces", ["xml:lang"] = "en", }, }, table#6810 { ["itemType"] = table#6811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5075627", }, ["subjectLabel"] = table#6813 { ["type"] = "literal", ["value"] = "SHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX OF TREES WITH GIVEN DEGREE SEQUENCES", ["xml:lang"] = "en", }, }, table#6814 { ["itemType"] = table#6815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5076144", }, ["subjectLabel"] = table#6817 { ["type"] = "literal", ["value"] = "2-RESERVED DOMINATION NUMBER OF GRAPHS", ["xml:lang"] = "en", }, }, table#6818 { ["itemType"] = table#6819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5080210", }, ["subjectLabel"] = table#6821 { ["type"] = "literal", ["value"] = "G-quadratic, LG-quadratic, and Koszul quotients of exterior algebras", ["xml:lang"] = "en", }, }, table#6822 { ["itemType"] = table#6823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5080786", }, ["subjectLabel"] = table#6825 { ["type"] = "literal", ["value"] = "A further result on the potential-Ramsey number of G1 and G2", ["xml:lang"] = "en", }, }, table#6826 { ["itemType"] = table#6827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5083496", }, ["subjectLabel"] = table#6829 { ["type"] = "literal", ["value"] = "On star coloring of modular product of graphs", ["xml:lang"] = "en", }, }, table#6830 { ["itemType"] = table#6831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5083505", }, ["subjectLabel"] = table#6833 { ["type"] = "literal", ["value"] = "Equitable edge coloring on tensor product of graphs", ["xml:lang"] = "en", }, }, table#6834 { ["itemType"] = table#6835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5083874", }, ["subjectLabel"] = table#6837 { ["type"] = "literal", ["value"] = "On generalized neighbor sum distinguishing index of planar graphs", ["xml:lang"] = "en", }, }, table#6838 { ["itemType"] = table#6839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5084258", }, ["subjectLabel"] = table#6841 { ["type"] = "literal", ["value"] = "The potential-Ramsey number of $K_n$ and $K_t^{-k}$", ["xml:lang"] = "en", }, }, table#6842 { ["itemType"] = table#6843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5085694", }, ["subjectLabel"] = table#6845 { ["type"] = "literal", ["value"] = "On achromatic number of central graph of some graphs", ["xml:lang"] = "en", }, }, table#6846 { ["itemType"] = table#6847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5085697", }, ["subjectLabel"] = table#6849 { ["type"] = "literal", ["value"] = "Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰", ["xml:lang"] = "en", }, }, table#6850 { ["itemType"] = table#6851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5085729", }, ["subjectLabel"] = table#6853 { ["type"] = "literal", ["value"] = "On equitable chromatic number of Tadpole graph T_{m,n}", ["xml:lang"] = "en", }, }, table#6854 { ["itemType"] = table#6855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5086798", }, ["subjectLabel"] = table#6857 { ["type"] = "literal", ["value"] = "Relationships between some distance-based topological indices", ["xml:lang"] = "en", }, }, table#6858 { ["itemType"] = table#6859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087059", }, ["subjectLabel"] = table#6861 { ["type"] = "literal", ["value"] = "Theg-Extra Conditional Diagnosability of Graphs in Terms ofg-Extra Connectivity", ["xml:lang"] = "en", }, }, table#6862 { ["itemType"] = table#6863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087061", }, ["subjectLabel"] = table#6865 { ["type"] = "literal", ["value"] = "5-Shredders of Contraction-Critical 5-Connected Graphs", ["xml:lang"] = "en", }, }, table#6866 { ["itemType"] = table#6867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087094", }, ["subjectLabel"] = table#6869 { ["type"] = "literal", ["value"] = "Contractible Edges in 3-Connected Cubic Graphs", ["xml:lang"] = "en", }, }, table#6870 { ["itemType"] = table#6871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087842", }, ["subjectLabel"] = table#6873 { ["type"] = "literal", ["value"] = "A Remark on Rainbow 6-Cycles in Hypercubes", ["xml:lang"] = "en", }, }, table#6874 { ["itemType"] = table#6875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087844", }, ["subjectLabel"] = table#6877 { ["type"] = "literal", ["value"] = "Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks", ["xml:lang"] = "en", }, }, table#6878 { ["itemType"] = table#6879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5095238", }, ["subjectLabel"] = table#6881 { ["type"] = "literal", ["value"] = "On the A_α spectral radius of digraphs with given parameters", ["xml:lang"] = "en", }, }, table#6882 { ["itemType"] = table#6883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5097280", }, ["subjectLabel"] = table#6885 { ["type"] = "literal", ["value"] = "Homogenization of the time-dependent heat equation on planar one-dimensional periodic structures", ["xml:lang"] = "en", }, }, table#6886 { ["itemType"] = table#6887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5097404", }, ["subjectLabel"] = table#6889 { ["type"] = "literal", ["value"] = "Line graph characterization of power graphs of finite nilpotent groups", ["xml:lang"] = "en", }, }, table#6890 { ["itemType"] = table#6891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5097777", }, ["subjectLabel"] = table#6893 { ["type"] = "literal", ["value"] = "Monophonic pebbling number and t-pebbling number of some graphs", ["xml:lang"] = "en", }, }, table#6894 { ["itemType"] = table#6895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5108388", }, ["subjectLabel"] = table#6897 { ["type"] = "literal", ["value"] = "The connection between evolution algebras, random walks and graphs", ["xml:lang"] = "en", }, }, table#6898 { ["itemType"] = table#6899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5110532", }, ["subjectLabel"] = table#6901 { ["type"] = "literal", ["value"] = "THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH", ["xml:lang"] = "en", }, }, table#6902 { ["itemType"] = table#6903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5112240", }, ["subjectLabel"] = table#6905 { ["type"] = "literal", ["value"] = "Bounds on the Spectral Radius of Digraphs from Subgraph Counts", ["xml:lang"] = "en", }, }, table#6906 { ["itemType"] = table#6907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5113072", }, ["subjectLabel"] = table#6909 { ["type"] = "literal", ["value"] = "The Zariski topology graph on scheme", ["xml:lang"] = "en", }, }, table#6910 { ["itemType"] = table#6911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5113538", }, ["subjectLabel"] = table#6913 { ["type"] = "literal", ["value"] = "Common Fixed Point Results in C ∗ -Algebra Valued b-Metric Spaces Via Digraphs", ["xml:lang"] = "en", }, }, table#6914 { ["itemType"] = table#6915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5129752", }, ["subjectLabel"] = table#6917 { ["type"] = "literal", ["value"] = "Comparison between Szeged indices of graphs", ["xml:lang"] = "en", }, }, table#6918 { ["itemType"] = table#6919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5140435", }, ["subjectLabel"] = table#6921 { ["type"] = "literal", ["value"] = "$\\mathcal F$-hypercyclic and disjoint $\\mathcal F$-hypercyclic properties of binary relations over topological spaces", ["xml:lang"] = "en", }, }, table#6922 { ["itemType"] = table#6923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5140890", }, ["subjectLabel"] = table#6925 { ["type"] = "literal", ["value"] = "Random growth networks with exponential degree distribution", ["xml:lang"] = "en", }, }, table#6926 { ["itemType"] = table#6927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5142124", }, ["subjectLabel"] = table#6929 { ["type"] = "literal", ["value"] = "On star coloring of degree splitting of join graphs", ["xml:lang"] = "en", }, }, table#6930 { ["itemType"] = table#6931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5151493", }, ["subjectLabel"] = table#6933 { ["type"] = "literal", ["value"] = "C_4-face-magic toroidal labelings on C_m × C_n", ["xml:lang"] = "en", }, }, table#6934 { ["itemType"] = table#6935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5154597", }, ["subjectLabel"] = table#6937 { ["type"] = "literal", ["value"] = "On transversal and 2-packing numbers in uniform linear systems", ["xml:lang"] = "en", }, }, table#6938 { ["itemType"] = table#6939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5154615", }, ["subjectLabel"] = table#6941 { ["type"] = "literal", ["value"] = "On group vertex magic graphs", ["xml:lang"] = "en", }, }, table#6942 { ["itemType"] = table#6943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5156451", }, ["subjectLabel"] = table#6945 { ["type"] = "literal", ["value"] = "Normalized Connectomes Show Increased Synchronizability with Age through Their Second Largest Eigenvalue", ["xml:lang"] = "en", }, }, table#6946 { ["itemType"] = table#6947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5158064", }, ["subjectLabel"] = table#6949 { ["type"] = "literal", ["value"] = "Annihilator graphs of MV-algebras", ["xml:lang"] = "en", }, }, table#6950 { ["itemType"] = table#6951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5158079", }, ["subjectLabel"] = table#6953 { ["type"] = "literal", ["value"] = "Compressed zero-divisor graphs of matrix rings over finite fields", ["xml:lang"] = "en", }, }, table#6954 { ["itemType"] = table#6955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5158411", }, ["subjectLabel"] = table#6957 { ["type"] = "literal", ["value"] = "Walks: A Beginner's Guide to Graphs and Matrices", ["xml:lang"] = "en", }, }, table#6958 { ["itemType"] = table#6959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5158886", }, ["subjectLabel"] = table#6961 { ["type"] = "literal", ["value"] = "Novel quantum phases on graphs using abelian gauge theory", ["xml:lang"] = "en", }, }, table#6962 { ["itemType"] = table#6963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5162978", }, ["subjectLabel"] = table#6965 { ["type"] = "literal", ["value"] = "Total Induced Vertex Stress in Barbell-Like Graphs", ["xml:lang"] = "en", }, }, table#6966 { ["itemType"] = table#6967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5164649", }, ["subjectLabel"] = table#6969 { ["type"] = "literal", ["value"] = "A graph associated to centralizer of elements of a group", ["xml:lang"] = "en", }, }, table#6970 { ["itemType"] = table#6971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5103950", }, ["subjectLabel"] = table#6973 { ["type"] = "literal", ["value"] = "On the reliability of modified bubble-sort graphs", ["xml:lang"] = "en", }, }, table#6974 { ["itemType"] = table#6975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5102423", }, ["subjectLabel"] = table#6977 { ["type"] = "literal", ["value"] = "$k$-distance enclaveless number of a graph", ["xml:lang"] = "en", }, }, table#6978 { ["itemType"] = table#6979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5070067", }, ["subjectLabel"] = table#6981 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5070067", }, }, table#6982 { ["itemType"] = table#6983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5070076", }, ["subjectLabel"] = table#6985 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5070076", }, }, table#6986 { ["itemType"] = table#6987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071141", }, ["subjectLabel"] = table#6989 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071141", }, }, table#6990 { ["itemType"] = table#6991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071864", }, ["subjectLabel"] = table#6993 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071864", }, }, table#6994 { ["itemType"] = table#6995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071875", }, ["subjectLabel"] = table#6997 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071875", }, }, table#6998 { ["itemType"] = table#6999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071882", }, ["subjectLabel"] = table#7001 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5071882", }, }, table#7002 { ["itemType"] = table#7003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5175373", }, ["subjectLabel"] = table#7005 { ["type"] = "literal", ["value"] = "Some new trace formulas of tensors with applications in spectral hypergraph theory", ["xml:lang"] = "en", }, }, table#7006 { ["itemType"] = table#7007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5175374", }, ["subjectLabel"] = table#7009 { ["type"] = "literal", ["value"] = "Bound on the least eigenvalue of a graph with cut vertices", ["xml:lang"] = "en", }, }, table#7010 { ["itemType"] = table#7011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5076577", }, ["subjectLabel"] = table#7013 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5076577", }, }, table#7014 { ["itemType"] = table#7015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5076851", }, ["subjectLabel"] = table#7017 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5076851", }, }, table#7018 { ["itemType"] = table#7019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5178355", }, ["subjectLabel"] = table#7021 { ["type"] = "literal", ["value"] = "Doubly connected domination in the join and Cartesian product of some graphs", ["xml:lang"] = "en", }, }, table#7022 { ["itemType"] = table#7023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5077098", }, ["subjectLabel"] = table#7025 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5077098", }, }, table#7026 { ["itemType"] = table#7027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5178965", }, ["subjectLabel"] = table#7029 { ["type"] = "literal", ["value"] = "A Logical Approach to Hamiltonian Graphs", ["xml:lang"] = "en", }, }, table#7030 { ["itemType"] = table#7031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5081905", }, ["subjectLabel"] = table#7033 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5081905", }, }, table#7034 { ["itemType"] = table#7035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5081907", }, ["subjectLabel"] = table#7037 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5081907", }, }, table#7038 { ["itemType"] = table#7039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5084018", }, ["subjectLabel"] = table#7041 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5084018", }, }, table#7042 { ["itemType"] = table#7043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5084415", }, ["subjectLabel"] = table#7045 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5084415", }, }, table#7046 { ["itemType"] = table#7047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5086038", }, ["subjectLabel"] = table#7049 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5086038", }, }, table#7050 { ["itemType"] = table#7051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087454", }, ["subjectLabel"] = table#7053 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5087454", }, }, table#7054 { ["itemType"] = table#7055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5191125", }, ["subjectLabel"] = table#7057 { ["type"] = "literal", ["value"] = "On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs", ["xml:lang"] = "en", }, }, table#7058 { ["itemType"] = table#7059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5193134", }, ["subjectLabel"] = table#7061 { ["type"] = "literal", ["value"] = "Mathematical models for failure reconfiguration of telecommunication networks: Part 1", ["xml:lang"] = "en", }, }, table#7062 { ["itemType"] = table#7063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5094910", }, ["subjectLabel"] = table#7065 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5094910", }, }, table#7066 { ["itemType"] = table#7067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5197547", }, ["subjectLabel"] = table#7069 { ["type"] = "literal", ["value"] = "Decompositions of some regular graphs into unicyclic graphs of order five", ["xml:lang"] = "en", }, }, table#7070 { ["itemType"] = table#7071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5134339", }, ["subjectLabel"] = table#7073 { ["type"] = "literal", ["value"] = "Star-path and star-stripe bipartite Ramsey numbers in multicoloring", ["xml:lang"] = "en", }, }, table#7074 { ["itemType"] = table#7075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5200331", }, ["subjectLabel"] = table#7077 { ["type"] = "literal", ["value"] = "On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set", ["xml:lang"] = "en", }, }, table#7078 { ["itemType"] = table#7079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5134517", }, ["subjectLabel"] = table#7081 { ["type"] = "literal", ["value"] = "The central vertices and radius of the regular graph of ideals", ["xml:lang"] = "en", }, }, table#7082 { ["itemType"] = table#7083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5104003", }, ["subjectLabel"] = table#7085 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5104003", }, }, table#7086 { ["itemType"] = table#7087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5139344", }, ["subjectLabel"] = table#7089 { ["type"] = "literal", ["value"] = "On clique values identities and mantel-type theorems", ["xml:lang"] = "en", }, }, table#7090 { ["itemType"] = table#7091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5135471", }, ["subjectLabel"] = table#7093 { ["type"] = "literal", ["value"] = "Degree resistance distance of trees with some given parameters", ["xml:lang"] = "en", }, }, table#7094 { ["itemType"] = table#7095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5135735", }, ["subjectLabel"] = table#7097 { ["type"] = "literal", ["value"] = "A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs", ["xml:lang"] = "en", }, }, table#7098 { ["itemType"] = table#7099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5106206", }, ["subjectLabel"] = table#7101 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5106206", }, }, table#7102 { ["itemType"] = table#7103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5109074", }, ["subjectLabel"] = table#7105 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5109074", }, }, table#7106 { ["itemType"] = table#7107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5109944", }, ["subjectLabel"] = table#7109 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5109944", }, }, table#7110 { ["itemType"] = table#7111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5151991", }, ["subjectLabel"] = table#7113 { ["type"] = "literal", ["value"] = "The zeroth-order general Randic index of graphs with a given clique number", ["xml:lang"] = "en", }, }, table#7114 { ["itemType"] = table#7115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5121946", }, ["subjectLabel"] = table#7117 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5121946", }, }, table#7118 { ["itemType"] = table#7119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5122465", }, ["subjectLabel"] = table#7121 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5122465", }, }, table#7122 { ["itemType"] = table#7123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5124081", }, ["subjectLabel"] = table#7125 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5124081", }, }, table#7126 { ["itemType"] = table#7127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5126162", }, ["subjectLabel"] = table#7129 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5126162", }, }, table#7130 { ["itemType"] = table#7131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5091022", }, ["subjectLabel"] = table#7133 { ["type"] = "literal", ["value"] = "New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition", ["xml:lang"] = "en", }, }, table#7134 { ["itemType"] = table#7135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5130656", }, ["subjectLabel"] = table#7137 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5130656", }, }, table#7138 { ["itemType"] = table#7139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5130689", }, ["subjectLabel"] = table#7141 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5130689", }, }, table#7142 { ["itemType"] = table#7143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5135791", }, ["subjectLabel"] = table#7145 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5135791", }, }, table#7146 { ["itemType"] = table#7147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5143274", }, ["subjectLabel"] = table#7149 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5143274", }, }, table#7150 { ["itemType"] = table#7151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5143278", }, ["subjectLabel"] = table#7153 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5143278", }, }, table#7154 { ["itemType"] = table#7155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5151914", }, ["subjectLabel"] = table#7157 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5151914", }, }, table#7158 { ["itemType"] = table#7159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5155176", }, ["subjectLabel"] = table#7161 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5155176", }, }, table#7162 { ["itemType"] = table#7163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5201922", }, ["subjectLabel"] = table#7165 { ["type"] = "literal", ["value"] = "Circuit Partitions and the Homfly Polynomial of Closed Braids", ["xml:lang"] = "en", }, }, table#7166 { ["itemType"] = table#7167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5164968", }, ["subjectLabel"] = table#7169 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5164968", }, }, table#7170 { ["itemType"] = table#7171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5164984", }, ["subjectLabel"] = table#7173 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5164984", }, }, table#7174 { ["itemType"] = table#7175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5197601", }, ["subjectLabel"] = table#7177 { ["type"] = "literal", ["value"] = "The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs", ["xml:lang"] = "en", }, }, table#7178 { ["itemType"] = table#7179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2121759", }, ["subjectLabel"] = table#7181 { ["type"] = "literal", ["value"] = "\$H\$-chromatic symmetric functions", ["xml:lang"] = "en", }, }, table#7182 { ["itemType"] = table#7183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2122793", }, ["subjectLabel"] = table#7185 { ["type"] = "literal", ["value"] = "The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs", ["xml:lang"] = "en", }, }, table#7186 { ["itemType"] = table#7187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2122794", }, ["subjectLabel"] = table#7189 { ["type"] = "literal", ["value"] = "The upper and lower bounds of \$R_g\$-conditional diagnosability of networks", ["xml:lang"] = "en", }, }, table#7190 { ["itemType"] = table#7191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2129767", }, ["subjectLabel"] = table#7193 { ["type"] = "literal", ["value"] = "On the eccentric connectivity coindex in graphs", ["xml:lang"] = "en", }, }, table#7194 { ["itemType"] = table#7195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2130516", }, ["subjectLabel"] = table#7197 { ["type"] = "literal", ["value"] = "Non-repeated cycle lengths and Sidon sequences", ["xml:lang"] = "en", }, }, table#7198 { ["itemType"] = table#7199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2130920", }, ["subjectLabel"] = table#7201 { ["type"] = "literal", ["value"] = "On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number", ["xml:lang"] = "en", }, }, table#7202 { ["itemType"] = table#7203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2131482", }, ["subjectLabel"] = table#7205 { ["type"] = "literal", ["value"] = "On the graph connectivity and the variable sum exdeg index", ["xml:lang"] = "en", }, }, table#7206 { ["itemType"] = table#7207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2131554", }, ["subjectLabel"] = table#7209 { ["type"] = "literal", ["value"] = "On the \$r\$-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph", ["xml:lang"] = "en", }, }, table#7210 { ["itemType"] = table#7211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2133231", }, ["subjectLabel"] = table#7213 { ["type"] = "literal", ["value"] = "The bounds of the energy and Laplacian energy of chain graphs", ["xml:lang"] = "en", }, }, table#7214 { ["itemType"] = table#7215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2133309", }, ["subjectLabel"] = table#7217 { ["type"] = "literal", ["value"] = "The \$k\$-subconnectedness of planar graphs", ["xml:lang"] = "en", }, }, table#7218 { ["itemType"] = table#7219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2133374", }, ["subjectLabel"] = table#7221 { ["type"] = "literal", ["value"] = "On symmetric division deg index of trees with given parameters", ["xml:lang"] = "en", }, }, table#7222 { ["itemType"] = table#7223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2134981", }, ["subjectLabel"] = table#7225 { ["type"] = "literal", ["value"] = "Non-solvable graphs of groups", ["xml:lang"] = "en", }, }, table#7226 { ["itemType"] = table#7227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2135050", }, ["subjectLabel"] = table#7229 { ["type"] = "literal", ["value"] = "The intersection graph of graded submodules of a graded module", ["xml:lang"] = "en", }, }, table#7230 { ["itemType"] = table#7231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2135476", }, ["subjectLabel"] = table#7233 { ["type"] = "literal", ["value"] = "On elegant labelling and magic labelling of large-scale graphs", ["xml:lang"] = "en", }, }, table#7234 { ["itemType"] = table#7235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2136165", }, ["subjectLabel"] = table#7237 { ["type"] = "literal", ["value"] = "Adjacent vertex distinguishing edge coloring of IC-planar graphs", ["xml:lang"] = "en", }, }, table#7238 { ["itemType"] = table#7239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2138553", }, ["subjectLabel"] = table#7241 { ["type"] = "literal", ["value"] = "Spectral radius, edge-disjoint cycles and cycles of the same length", ["xml:lang"] = "en", }, }, table#7242 { ["itemType"] = table#7243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2138949", }, ["subjectLabel"] = table#7245 { ["type"] = "literal", ["value"] = "Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II", ["xml:lang"] = "en", }, }, table#7246 { ["itemType"] = table#7247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2139791", }, ["subjectLabel"] = table#7249 { ["type"] = "literal", ["value"] = "The (strong) structure connectivity and (strong) substructure connectivity of the \$( n , k )\$-bubble-sort network", ["xml:lang"] = "en", }, }, table#7250 { ["itemType"] = table#7251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2141341", }, ["subjectLabel"] = table#7253 { ["type"] = "literal", ["value"] = "A note on the Turán number of an arbitrary star forest", ["xml:lang"] = "en", }, }, table#7254 { ["itemType"] = table#7255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2142644", }, ["subjectLabel"] = table#7257 { ["type"] = "literal", ["value"] = "Decomposition of \$(2k + 1)\$-regular graphs containing special spanning \$2k\$-regular Cayley graphs into paths of length \$2k + 1\$", ["xml:lang"] = "en", }, }, table#7258 { ["itemType"] = table#7259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2142650", }, ["subjectLabel"] = table#7261 { ["type"] = "literal", ["value"] = "A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs", ["xml:lang"] = "en", }, }, table#7262 { ["itemType"] = table#7263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2142661", }, ["subjectLabel"] = table#7265 { ["type"] = "literal", ["value"] = "The nullity of a graph with fractional matching number", ["xml:lang"] = "en", }, }, table#7266 { ["itemType"] = table#7267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2142688", }, ["subjectLabel"] = table#7269 { ["type"] = "literal", ["value"] = "Extremal graphs with respect to two distance-based topological indices", ["xml:lang"] = "en", }, }, table#7270 { ["itemType"] = table#7271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2143442", }, ["subjectLabel"] = table#7273 { ["type"] = "literal", ["value"] = "Complete forcing numbers of hexagonal systems. II", ["xml:lang"] = "en", }, }, table#7274 { ["itemType"] = table#7275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2143824", }, ["subjectLabel"] = table#7277 { ["type"] = "literal", ["value"] = "Matching numbers in fuzzy graphs", ["xml:lang"] = "en", }, }, table#7278 { ["itemType"] = table#7279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2144500", }, ["subjectLabel"] = table#7281 { ["type"] = "literal", ["value"] = "Competitively orientable complete multipartite graphs", ["xml:lang"] = "en", }, }, table#7282 { ["itemType"] = table#7283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2144591", }, ["subjectLabel"] = table#7285 { ["type"] = "literal", ["value"] = "Extremal digraphs avoiding distinct walks of length 3 with the same endpoints", ["xml:lang"] = "en", }, }, table#7286 { ["itemType"] = table#7287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2147600", }, ["subjectLabel"] = table#7289 { ["type"] = "literal", ["value"] = "On trees and unicyclic graphs with equal forcing-type numbers", ["xml:lang"] = "en", }, }, table#7290 { ["itemType"] = table#7291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2147746", }, ["subjectLabel"] = table#7293 { ["type"] = "literal", ["value"] = "The relations between network-operation and topological-property in a scale-free and small-world network with community structure", ["xml:lang"] = "en", }, }, table#7294 { ["itemType"] = table#7295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2147883", }, ["subjectLabel"] = table#7297 { ["type"] = "literal", ["value"] = "Multi-objective optimization model and evolutional solution of network node matching problem", ["xml:lang"] = "en", }, }, table#7298 { ["itemType"] = table#7299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2149595", }, ["subjectLabel"] = table#7301 { ["type"] = "literal", ["value"] = "Cycle extendability in extended tournaments", ["xml:lang"] = "en", }, }, table#7302 { ["itemType"] = table#7303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2155121", }, ["subjectLabel"] = table#7305 { ["type"] = "literal", ["value"] = "The impact of intermediaries on a negotiation: an approach from game theory", ["xml:lang"] = "en", }, }, table#7306 { ["itemType"] = table#7307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2155553", }, ["subjectLabel"] = table#7309 { ["type"] = "literal", ["value"] = "3-critical subgraphs of snarks", ["xml:lang"] = "en", }, }, table#7310 { ["itemType"] = table#7311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2158037", }, ["subjectLabel"] = table#7313 { ["type"] = "literal", ["value"] = "Consensus reaching process in large-scale group decision making based on bounded confidence and social network", ["xml:lang"] = "en", }, }, table#7314 { ["itemType"] = table#7315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2158193", }, ["subjectLabel"] = table#7317 { ["type"] = "literal", ["value"] = "The Turán number for \$4 \\cdot S_{\\ell}^1\$", ["xml:lang"] = "en", }, }, table#7318 { ["itemType"] = table#7319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2158295", }, ["subjectLabel"] = table#7321 { ["type"] = "literal", ["value"] = "The rank of a signed graph", ["xml:lang"] = "en", }, }, table#7322 { ["itemType"] = table#7323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2161760", }, ["subjectLabel"] = table#7325 { ["type"] = "literal", ["value"] = "Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory", ["xml:lang"] = "en", }, }, table#7326 { ["itemType"] = table#7327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2163223", }, ["subjectLabel"] = table#7329 { ["type"] = "literal", ["value"] = "Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs", ["xml:lang"] = "en", }, }, table#7330 { ["itemType"] = table#7331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2163458", }, ["subjectLabel"] = table#7333 { ["type"] = "literal", ["value"] = "Numerical approximation of the spectrum of self-adjoint operators in operator preconditioning", ["xml:lang"] = "en", }, }, table#7334 { ["itemType"] = table#7335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2164991", }, ["subjectLabel"] = table#7337 { ["type"] = "literal", ["value"] = "The number of copies of \$K_{2,t+1}\$ in a graph", ["xml:lang"] = "en", }, }, table#7338 { ["itemType"] = table#7339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2165254", }, ["subjectLabel"] = table#7341 { ["type"] = "literal", ["value"] = "On networks with order close to the Moore bound", ["xml:lang"] = "en", }, }, table#7342 { ["itemType"] = table#7343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2166213", }, ["subjectLabel"] = table#7345 { ["type"] = "literal", ["value"] = "On extremal spectral results of digraphs based on sum distance", ["xml:lang"] = "en", }, }, table#7346 { ["itemType"] = table#7347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2168591", }, ["subjectLabel"] = table#7349 { ["type"] = "literal", ["value"] = "Extremal symmetric division deg index of molecular trees and molecular graphs with fixed number of pendant vertices", ["xml:lang"] = "en", }, }, table#7350 { ["itemType"] = table#7351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2168776", }, ["subjectLabel"] = table#7353 { ["type"] = "literal", ["value"] = "Finding a minimal spanning hypertree of a weighted hypergraph", ["xml:lang"] = "en", }, }, table#7354 { ["itemType"] = table#7355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2169960", }, ["subjectLabel"] = table#7357 { ["type"] = "literal", ["value"] = "Perfect matching cuts partitioning a graph into complementary subgraphs", ["xml:lang"] = "en", }, }, table#7358 { ["itemType"] = table#7359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2170502", }, ["subjectLabel"] = table#7361 { ["type"] = "literal", ["value"] = "On the \$D(2)\$-vertex distinguishing total coloring of graphs with \$\\Delta=3\$", ["xml:lang"] = "en", }, }, table#7362 { ["itemType"] = table#7363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2045233", }, ["subjectLabel"] = table#7365 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings of corona of subcubic graphs", ["xml:lang"] = "en", }, }, table#7366 { ["itemType"] = table#7367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2046284", }, ["subjectLabel"] = table#7369 { ["type"] = "literal", ["value"] = "Complete forcing numbers of hexagonal systems", ["xml:lang"] = "en", }, }, table#7370 { ["itemType"] = table#7371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2049008", }, ["subjectLabel"] = table#7373 { ["type"] = "literal", ["value"] = "Upper bounds for the independence polynomial of graphs at \$-1\$", ["xml:lang"] = "en", }, }, table#7374 { ["itemType"] = table#7375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2049019", }, ["subjectLabel"] = table#7377 { ["type"] = "literal", ["value"] = "On the commuting graph of semidihedral group", ["xml:lang"] = "en", }, }, table#7378 { ["itemType"] = table#7379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2051698", }, ["subjectLabel"] = table#7381 { ["type"] = "literal", ["value"] = "Comparison of the Wiener and Kirchhoff indices of random pentachains", ["xml:lang"] = "en", }, }, table#7382 { ["itemType"] = table#7383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2052088", }, ["subjectLabel"] = table#7385 { ["type"] = "literal", ["value"] = "Omega index of line and total graphs", ["xml:lang"] = "en", }, }, table#7386 { ["itemType"] = table#7387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2053092", }, ["subjectLabel"] = table#7389 { ["type"] = "literal", ["value"] = "Comparative study of distance-based graph invariants", ["xml:lang"] = "en", }, }, table#7390 { ["itemType"] = table#7391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2053544", }, ["subjectLabel"] = table#7393 { ["type"] = "literal", ["value"] = "Connected even factors in \$k\$-tree", ["xml:lang"] = "en", }, }, table#7394 { ["itemType"] = table#7395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2053668", }, ["subjectLabel"] = table#7397 { ["type"] = "literal", ["value"] = "Distributions of near-4-regular maps on the sphere and the projective plane", ["xml:lang"] = "en", }, }, table#7398 { ["itemType"] = table#7399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2053694", }, ["subjectLabel"] = table#7401 { ["type"] = "literal", ["value"] = "A sufficient condition for an IC-planar graph to be class 1", ["xml:lang"] = "en", }, }, table#7402 { ["itemType"] = table#7403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2055049", }, ["subjectLabel"] = table#7405 { ["type"] = "literal", ["value"] = "A gentle introduction to deep learning for graphs", ["xml:lang"] = "en", }, }, table#7406 { ["itemType"] = table#7407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2055969", }, ["subjectLabel"] = table#7409 { ["type"] = "literal", ["value"] = "The \$R_g\$-conditional diagnosability of international networks", ["xml:lang"] = "en", }, }, table#7410 { ["itemType"] = table#7411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2057600", }, ["subjectLabel"] = table#7413 { ["type"] = "literal", ["value"] = "Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs", ["xml:lang"] = "en", }, }, table#7414 { ["itemType"] = table#7415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2060249", }, ["subjectLabel"] = table#7417 { ["type"] = "literal", ["value"] = "On the Turán numbers of \$k K_r\$ in \$\\ell \$-partite graphs", ["xml:lang"] = "en", }, }, table#7418 { ["itemType"] = table#7419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2061289", }, ["subjectLabel"] = table#7421 { ["type"] = "literal", ["value"] = "Degree tolerant coloring of graph", ["xml:lang"] = "en", }, }, table#7422 { ["itemType"] = table#7423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2062511", }, ["subjectLabel"] = table#7425 { ["type"] = "literal", ["value"] = "Contextuality, fine-tuning and teleological explanation", ["xml:lang"] = "en", }, }, table#7426 { ["itemType"] = table#7427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2062899", }, ["subjectLabel"] = table#7429 { ["type"] = "literal", ["value"] = "Mean color numbers of some graphs", ["xml:lang"] = "en", }, }, table#7430 { ["itemType"] = table#7431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2065117", }, ["subjectLabel"] = table#7433 { ["type"] = "literal", ["value"] = "Properly colored short cycles in edge-colored graphs", ["xml:lang"] = "en", }, }, table#7434 { ["itemType"] = table#7435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2065764", }, ["subjectLabel"] = table#7437 { ["type"] = "literal", ["value"] = "Measurement and algorithm for conditional local diagnosis of regular networks under the \$\\mathrm{MM}^\\ast\$ model", ["xml:lang"] = "en", }, }, table#7438 { ["itemType"] = table#7439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2069220", }, ["subjectLabel"] = table#7441 { ["type"] = "literal", ["value"] = "Information propagation in stochastic networks", ["xml:lang"] = "en", }, }, table#7442 { ["itemType"] = table#7443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2070081", }, ["subjectLabel"] = table#7445 { ["type"] = "literal", ["value"] = "DP color functions versus chromatic polynomials", ["xml:lang"] = "en", }, }, table#7446 { ["itemType"] = table#7447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2075470", }, ["subjectLabel"] = table#7449 { ["type"] = "literal", ["value"] = "Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem", ["xml:lang"] = "en", }, }, table#7450 { ["itemType"] = table#7451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2078611", }, ["subjectLabel"] = table#7453 { ["type"] = "literal", ["value"] = "Total coloring of recursive maximal planar graphs", ["xml:lang"] = "en", }, }, table#7454 { ["itemType"] = table#7455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2078619", }, ["subjectLabel"] = table#7457 { ["type"] = "literal", ["value"] = "On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem", ["xml:lang"] = "en", }, }, table#7458 { ["itemType"] = table#7459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2078840", }, ["subjectLabel"] = table#7461 { ["type"] = "literal", ["value"] = "Nordhaus-Gaddum type inequality for the fractional matching number of a graph", ["xml:lang"] = "en", }, }, table#7462 { ["itemType"] = table#7463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2079135", }, ["subjectLabel"] = table#7465 { ["type"] = "literal", ["value"] = "On Sombor index of trees with fixed domination number", ["xml:lang"] = "en", }, }, table#7466 { ["itemType"] = table#7467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2081466", }, ["subjectLabel"] = table#7469 { ["type"] = "literal", ["value"] = "The eccentricity matrix of a digraph", ["xml:lang"] = "en", }, }, table#7470 { ["itemType"] = table#7471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2081502", }, ["subjectLabel"] = table#7473 { ["type"] = "literal", ["value"] = "On the Merrifield-Simmons index of tricyclic graphs", ["xml:lang"] = "en", }, }, table#7474 { ["itemType"] = table#7475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2081504", }, ["subjectLabel"] = table#7477 { ["type"] = "literal", ["value"] = "Fibonacci and Lucas \$p\$-cubes", ["xml:lang"] = "en", }, }, table#7478 { ["itemType"] = table#7479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2087256", }, ["subjectLabel"] = table#7481 { ["type"] = "literal", ["value"] = "Lattice fermions as spectral graphs", ["xml:lang"] = "en", }, }, table#7482 { ["itemType"] = table#7483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2087672", }, ["subjectLabel"] = table#7485 { ["type"] = "literal", ["value"] = "Rainbow and monochromatic vertex-connection of random graphs", ["xml:lang"] = "en", }, }, table#7486 { ["itemType"] = table#7487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2089551", }, ["subjectLabel"] = table#7489 { ["type"] = "literal", ["value"] = "Regular graph and some vertex-deleted subgraph", ["xml:lang"] = "en", }, }, table#7490 { ["itemType"] = table#7491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2091162", }, ["subjectLabel"] = table#7493 { ["type"] = "literal", ["value"] = "Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras", ["xml:lang"] = "en", }, }, table#7494 { ["itemType"] = table#7495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2091163", }, ["subjectLabel"] = table#7497 { ["type"] = "literal", ["value"] = "\$\\ell\$-connectivity, integrity, tenacity, toughness and eigenvalues of graphs", ["xml:lang"] = "en", }, }, table#7498 { ["itemType"] = table#7499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2092342", }, ["subjectLabel"] = table#7501 { ["type"] = "literal", ["value"] = "Anti-Ramsey numbers for vertex-disjoint triangles", ["xml:lang"] = "en", }, }, table#7502 { ["itemType"] = table#7503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2092344", }, ["subjectLabel"] = table#7505 { ["type"] = "literal", ["value"] = "Locating-dominating sets: from graphs to oriented graphs", ["xml:lang"] = "en", }, }, table#7506 { ["itemType"] = table#7507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2092355", }, ["subjectLabel"] = table#7509 { ["type"] = "literal", ["value"] = "On the \$D_\\alpha\$-spectral radius of cacti and bicyclic graphs", ["xml:lang"] = "en", }, }, table#7510 { ["itemType"] = table#7511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2092386", }, ["subjectLabel"] = table#7513 { ["type"] = "literal", ["value"] = "Decomposition of complete equipartite graphs into paths and cycles of length \$2p\$", ["xml:lang"] = "en", }, }, table#7514 { ["itemType"] = table#7515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2093107", }, ["subjectLabel"] = table#7517 { ["type"] = "literal", ["value"] = "Degree conditions for completely independent spanning trees of bipartite graphs", ["xml:lang"] = "en", }, }, table#7518 { ["itemType"] = table#7519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2095066", }, ["subjectLabel"] = table#7521 { ["type"] = "literal", ["value"] = "On the annihilator graph of a commutative ring", ["xml:lang"] = "en", }, }, table#7522 { ["itemType"] = table#7523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2097113", }, ["subjectLabel"] = table#7525 { ["type"] = "literal", ["value"] = "Genus and book thickness of the inclusion ideal graph of a ring", ["xml:lang"] = "en", }, }, table#7526 { ["itemType"] = table#7527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2099486", }, ["subjectLabel"] = table#7529 { ["type"] = "literal", ["value"] = "Matching theory and Barnette's conjecture", ["xml:lang"] = "en", }, }, table#7530 { ["itemType"] = table#7531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2099961", }, ["subjectLabel"] = table#7533 { ["type"] = "literal", ["value"] = "Fuzzy topological structures via fuzzy graphs and their applications", ["xml:lang"] = "en", }, }, table#7534 { ["itemType"] = table#7535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2102763", }, ["subjectLabel"] = table#7537 { ["type"] = "literal", ["value"] = "2-proper partition of a graph", ["xml:lang"] = "en", }, }, table#7538 { ["itemType"] = table#7539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2104938", }, ["subjectLabel"] = table#7541 { ["type"] = "literal", ["value"] = "Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices", ["xml:lang"] = "en", }, }, table#7542 { ["itemType"] = table#7543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2107737", }, ["subjectLabel"] = table#7545 { ["type"] = "literal", ["value"] = "The existence of path-factor covered graphs", ["xml:lang"] = "en", }, }, table#7546 { ["itemType"] = table#7547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2108949", }, ["subjectLabel"] = table#7549 { ["type"] = "literal", ["value"] = "The Seidel Laplacian energy of unitary Cayley graphs", ["xml:lang"] = "en", }, }, table#7550 { ["itemType"] = table#7551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2112651", }, ["subjectLabel"] = table#7553 { ["type"] = "literal", ["value"] = "Relations between degree-based graph invariants", ["xml:lang"] = "en", }, }, table#7554 { ["itemType"] = table#7555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2113359", }, ["subjectLabel"] = table#7557 { ["type"] = "literal", ["value"] = "\$k\$-spectrally monomorphic tournaments", ["xml:lang"] = "en", }, }, table#7558 { ["itemType"] = table#7559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2115146", }, ["subjectLabel"] = table#7561 { ["type"] = "literal", ["value"] = "A note on extremal digraphs containing at most \$t\$ walks of length \$k\$ with the same endpoints", ["xml:lang"] = "en", }, }, table#7562 { ["itemType"] = table#7563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2117527", }, ["subjectLabel"] = table#7565 { ["type"] = "literal", ["value"] = "\$H\$-cycles in \$H\$-colored multigraphs", ["xml:lang"] = "en", }, }, table#7566 { ["itemType"] = table#7567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2117537", }, ["subjectLabel"] = table#7569 { ["type"] = "literal", ["value"] = "On sufficient conditions for planar graphs to be 5-flexible", ["xml:lang"] = "en", }, }, table#7570 { ["itemType"] = table#7571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2118248", }, ["subjectLabel"] = table#7573 { ["type"] = "literal", ["value"] = "Corrigendum to: ``Independent transversal domination in graphs''", ["xml:lang"] = "en", }, }, table#7574 { ["itemType"] = table#7575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2118867", }, ["subjectLabel"] = table#7577 { ["type"] = "literal", ["value"] = "Structure fault tolerance of WK-recursive networks", ["xml:lang"] = "en", }, }, table#7578 { ["itemType"] = table#7579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5282775", }, ["subjectLabel"] = table#7581 { ["type"] = "literal", ["value"] = "Binding number, minimum degree and bipancyclism in bipartite graphs", ["xml:lang"] = "en", }, }, table#7582 { ["itemType"] = table#7583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5287449", }, ["subjectLabel"] = table#7585 { ["type"] = "literal", ["value"] = "Decomposition of bipartite graphs under degree constraints", ["xml:lang"] = "en", }, }, table#7586 { ["itemType"] = table#7587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5287453", }, ["subjectLabel"] = table#7589 { ["type"] = "literal", ["value"] = "Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs", ["xml:lang"] = "en", }, }, table#7590 { ["itemType"] = table#7591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5289375", }, ["subjectLabel"] = table#7593 { ["type"] = "literal", ["value"] = "The most vital edges of matching in a bipartite graph", ["xml:lang"] = "en", }, }, table#7594 { ["itemType"] = table#7595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5203981", }, ["subjectLabel"] = table#7597 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5203981", }, }, table#7598 { ["itemType"] = table#7599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5203985", }, ["subjectLabel"] = table#7601 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5203985", }, }, table#7602 { ["itemType"] = table#7603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5297706", }, ["subjectLabel"] = table#7605 { ["type"] = "literal", ["value"] = "Some sufficient conditions for graphs to have (g, f)-factors", ["xml:lang"] = "en", }, }, table#7606 { ["itemType"] = table#7607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5298358", }, ["subjectLabel"] = table#7609 { ["type"] = "literal", ["value"] = "On the projective comaximal graphs of lattices", ["xml:lang"] = "en", }, }, table#7610 { ["itemType"] = table#7611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5205503", }, ["subjectLabel"] = table#7613 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5205503", }, }, table#7614 { ["itemType"] = table#7615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5300034", }, ["subjectLabel"] = table#7617 { ["type"] = "literal", ["value"] = "Sharp bounds on distance spectral radius of graphs", ["xml:lang"] = "en", }, }, table#7618 { ["itemType"] = table#7619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5300063", }, ["subjectLabel"] = table#7621 { ["type"] = "literal", ["value"] = "Bounds of spectral radii on edge-most outer-planar bipartite graphs", ["xml:lang"] = "en", }, }, table#7622 { ["itemType"] = table#7623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5210490", }, ["subjectLabel"] = table#7625 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5210490", }, }, table#7626 { ["itemType"] = table#7627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5223066", }, ["subjectLabel"] = table#7629 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5223066", }, }, table#7630 { ["itemType"] = table#7631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5318243", }, ["subjectLabel"] = table#7633 { ["type"] = "literal", ["value"] = "Nowhere‐zero 3‐flows in products of graphs", ["xml:lang"] = "en", }, }, table#7634 { ["itemType"] = table#7635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5224186", }, ["subjectLabel"] = table#7637 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5224186", }, }, table#7638 { ["itemType"] = table#7639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5320228", }, ["subjectLabel"] = table#7641 { ["type"] = "literal", ["value"] = "Clique-transversal number of graphs whose clique-graphs are trees", ["xml:lang"] = "en", }, }, table#7642 { ["itemType"] = table#7643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5225455", }, ["subjectLabel"] = table#7645 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5225455", }, }, table#7646 { ["itemType"] = table#7647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5228091", }, ["subjectLabel"] = table#7649 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5228091", }, }, table#7650 { ["itemType"] = table#7651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5228099", }, ["subjectLabel"] = table#7653 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5228099", }, }, table#7654 { ["itemType"] = table#7655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5324146", }, ["subjectLabel"] = table#7657 { ["type"] = "literal", ["value"] = "LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER", ["xml:lang"] = "en", }, }, table#7658 { ["itemType"] = table#7659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5326273", }, ["subjectLabel"] = table#7661 { ["type"] = "literal", ["value"] = "Smarandache Vertices of the Graphs Associated to the Commutative Rings", ["xml:lang"] = "en", }, }, table#7662 { ["itemType"] = table#7663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5236519", }, ["subjectLabel"] = table#7665 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5236519", }, }, table#7666 { ["itemType"] = table#7667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5236541", }, ["subjectLabel"] = table#7669 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5236541", }, }, table#7670 { ["itemType"] = table#7671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5241089", }, ["subjectLabel"] = table#7673 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5241089", }, }, table#7674 { ["itemType"] = table#7675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5241196", }, ["subjectLabel"] = table#7677 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5241196", }, }, table#7678 { ["itemType"] = table#7679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5346576", }, ["subjectLabel"] = table#7681 { ["type"] = "literal", ["value"] = "Triple Systems are Eulerian", ["xml:lang"] = "en", }, }, table#7682 { ["itemType"] = table#7683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5347254", }, ["subjectLabel"] = table#7685 { ["type"] = "literal", ["value"] = "Random graph languages", ["xml:lang"] = "en", }, }, table#7686 { ["itemType"] = table#7687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5357506", }, ["subjectLabel"] = table#7689 { ["type"] = "literal", ["value"] = "Neighbor Rupture Degree of Transformation Graphs Gxy−", ["xml:lang"] = "en", }, }, table#7690 { ["itemType"] = table#7691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5370790", }, ["subjectLabel"] = table#7693 { ["type"] = "literal", ["value"] = "ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS", ["xml:lang"] = "en", }, }, table#7694 { ["itemType"] = table#7695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5374105", }, ["subjectLabel"] = table#7697 { ["type"] = "literal", ["value"] = "Visibility of quantum graph spectrum from the vertices", ["xml:lang"] = "en", }, }, table#7698 { ["itemType"] = table#7699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5378344", }, ["subjectLabel"] = table#7701 { ["type"] = "literal", ["value"] = "Large Margin Low Rank Tensor Analysis", ["xml:lang"] = "en", }, }, table#7702 { ["itemType"] = table#7703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5383827", }, ["subjectLabel"] = table#7705 { ["type"] = "literal", ["value"] = "Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach", ["xml:lang"] = "en", }, }, table#7706 { ["itemType"] = table#7707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5384526", }, ["subjectLabel"] = table#7709 { ["type"] = "literal", ["value"] = "Exponential Independence Number of Some Graphs", ["xml:lang"] = "en", }, }, table#7710 { ["itemType"] = table#7711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5384747", }, ["subjectLabel"] = table#7713 { ["type"] = "literal", ["value"] = "Edge-Cuts of Optimal Average Weights", ["xml:lang"] = "en", }, }, table#7714 { ["itemType"] = table#7715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5387740", }, ["subjectLabel"] = table#7717 { ["type"] = "literal", ["value"] = "Coloring Triangle-Free Graphs on Surfaces", ["xml:lang"] = "en", }, }, table#7718 { ["itemType"] = table#7719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5696963", }, ["subjectLabel"] = table#7721 { ["type"] = "literal", ["value"] = "COLORING ALGORITHMS ON SUBCUBIC GRAPHS", ["xml:lang"] = "en", }, }, table#7722 { ["itemType"] = table#7723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5391502", }, ["subjectLabel"] = table#7725 { ["type"] = "literal", ["value"] = "Some new sufficient conditions for graphs to have fractionalk-factors", ["xml:lang"] = "en", }, }, table#7726 { ["itemType"] = table#7727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5706478", }, ["subjectLabel"] = table#7729 { ["type"] = "literal", ["value"] = "Hamilton connectivity of line graphs and claw‐free graphs", ["xml:lang"] = "en", }, }, table#7730 { ["itemType"] = table#7731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5401611", }, ["subjectLabel"] = table#7733 { ["type"] = "literal", ["value"] = "ON THE GIRTH OF THE UNIT GRAPH OF A RING", ["xml:lang"] = "en", }, }, table#7734 { ["itemType"] = table#7735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5711699", }, ["subjectLabel"] = table#7737 { ["type"] = "literal", ["value"] = "Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#7738 { ["itemType"] = table#7739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5409775", }, ["subjectLabel"] = table#7741 { ["type"] = "literal", ["value"] = "A Generalization of Noncommuting Graph via Automorphisms of a Group", ["xml:lang"] = "en", }, }, table#7742 { ["itemType"] = table#7743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5409954", }, ["subjectLabel"] = table#7745 { ["type"] = "literal", ["value"] = "The minimal Laplacian spectral radius of trees with given matching number", ["xml:lang"] = "en", }, }, table#7746 { ["itemType"] = table#7747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5411805", }, ["subjectLabel"] = table#7749 { ["type"] = "literal", ["value"] = "A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS", ["xml:lang"] = "en", }, }, table#7750 { ["itemType"] = table#7751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5418542", }, ["subjectLabel"] = table#7753 { ["type"] = "literal", ["value"] = "Fan type condition and characterization of Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#7754 { ["itemType"] = table#7755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5737862", }, ["subjectLabel"] = table#7757 { ["type"] = "literal", ["value"] = "Euler index of uncertain random graph: concepts and properties", ["xml:lang"] = "en", }, }, table#7758 { ["itemType"] = table#7759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5737871", }, ["subjectLabel"] = table#7761 { ["type"] = "literal", ["value"] = "Trees with large numbers of subtrees", ["xml:lang"] = "en", }, }, table#7762 { ["itemType"] = table#7763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5737875", }, ["subjectLabel"] = table#7765 { ["type"] = "literal", ["value"] = "The extremal values of connective eccentricity index for trees and unicyclic graphs", ["xml:lang"] = "en", }, }, table#7766 { ["itemType"] = table#7767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5420693", }, ["subjectLabel"] = table#7769 { ["type"] = "literal", ["value"] = "Combinatorial dimensions: Indecomposability on certain local finite-dimensional trivial extension algebras", ["xml:lang"] = "en", }, }, table#7770 { ["itemType"] = table#7771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5749318", }, ["subjectLabel"] = table#7773 { ["type"] = "literal", ["value"] = "On the cycle‐isomorphism of graphs", ["xml:lang"] = "en", }, }, table#7774 { ["itemType"] = table#7775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5434257", }, ["subjectLabel"] = table#7777 { ["type"] = "literal", ["value"] = "Ore‐type condition for the existence of connected factors", ["xml:lang"] = "en", }, }, table#7778 { ["itemType"] = table#7779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5434258", }, ["subjectLabel"] = table#7781 { ["type"] = "literal", ["value"] = "Hamilton cycles in prisms", ["xml:lang"] = "en", }, }, table#7782 { ["itemType"] = table#7783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5436223", }, ["subjectLabel"] = table#7785 { ["type"] = "literal", ["value"] = "Power domination in planar graphs with small diameter", ["xml:lang"] = "en", }, }, table#7786 { ["itemType"] = table#7787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5752604", }, ["subjectLabel"] = table#7789 { ["type"] = "literal", ["value"] = "One sufficient condition for hamiltonian graphs", ["xml:lang"] = "en", }, }, table#7790 { ["itemType"] = table#7791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5752605", }, ["subjectLabel"] = table#7793 { ["type"] = "literal", ["value"] = "Hamilton cycles and closed trails in iterated line graphs", ["xml:lang"] = "en", }, }, table#7794 { ["itemType"] = table#7795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5438368", }, ["subjectLabel"] = table#7797 { ["type"] = "literal", ["value"] = "Notes on the binding numbers for (a, b, k)-critical graphs", ["xml:lang"] = "en", }, }, table#7798 { ["itemType"] = table#7799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5438691", }, ["subjectLabel"] = table#7801 { ["type"] = "literal", ["value"] = "Vulnerability parameters of split graphs", ["xml:lang"] = "en", }, }, table#7802 { ["itemType"] = table#7803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5254089", }, ["subjectLabel"] = table#7805 { ["type"] = "literal", ["value"] = "TSP Tours in Cubic Graphs: Beyond 4/3", ["xml:lang"] = "en", }, }, table#7806 { ["itemType"] = table#7807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5203059", }, ["subjectLabel"] = table#7809 { ["type"] = "literal", ["value"] = "Perfect path double covers in every simple graph", ["xml:lang"] = "en", }, }, table#7810 { ["itemType"] = table#7811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5452428", }, ["subjectLabel"] = table#7813 { ["type"] = "literal", ["value"] = "Unique Factorization Theorem and Formal Concept Analysis", ["xml:lang"] = "en", }, }, table#7814 { ["itemType"] = table#7815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5205827", }, ["subjectLabel"] = table#7817 { ["type"] = "literal", ["value"] = "Physically feasible decomposition of Engino® toy models: A graph-theoretic approach", ["xml:lang"] = "en", }, }, table#7818 { ["itemType"] = table#7819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5206449", }, ["subjectLabel"] = table#7821 { ["type"] = "literal", ["value"] = "Note on improper coloring of $1$-planar graphs", ["xml:lang"] = "en", }, }, table#7822 { ["itemType"] = table#7823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5207034", }, ["subjectLabel"] = table#7825 { ["type"] = "literal", ["value"] = "Fault-Tolerant Panconnectivity of Augmented Cubes AQn", ["xml:lang"] = "en", }, }, table#7826 { ["itemType"] = table#7827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5462388", }, ["subjectLabel"] = table#7829 { ["type"] = "literal", ["value"] = "Nowhere zero 4‐flow in regular matroids", ["xml:lang"] = "en", }, }, table#7830 { ["itemType"] = table#7831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5214308", }, ["subjectLabel"] = table#7833 { ["type"] = "literal", ["value"] = "On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics", ["xml:lang"] = "en", }, }, table#7834 { ["itemType"] = table#7835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5466760", }, ["subjectLabel"] = table#7837 { ["type"] = "literal", ["value"] = "Rupture degree of graphs", ["xml:lang"] = "en", }, }, table#7838 { ["itemType"] = table#7839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5216252", }, ["subjectLabel"] = table#7841 { ["type"] = "literal", ["value"] = "Matrix Analysis and Omega Calculus", ["xml:lang"] = "en", }, }, table#7842 { ["itemType"] = table#7843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5374233", }, ["subjectLabel"] = table#7845 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5374233", }, }, table#7846 { ["itemType"] = table#7847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5469140", }, ["subjectLabel"] = table#7849 { ["type"] = "literal", ["value"] = "Average degree and contractibility", ["xml:lang"] = "en", }, }, table#7850 { ["itemType"] = table#7851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5471011", }, ["subjectLabel"] = table#7853 { ["type"] = "literal", ["value"] = "Claw‐decompositions and tutte‐orientations", ["xml:lang"] = "en", }, }, table#7854 { ["itemType"] = table#7855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5471059", }, ["subjectLabel"] = table#7857 { ["type"] = "literal", ["value"] = "Group chromatic number of planar graphs of girth at least 4", ["xml:lang"] = "en", }, }, table#7858 { ["itemType"] = table#7859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5377039", }, ["subjectLabel"] = table#7861 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5377039", }, }, table#7862 { ["itemType"] = table#7863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5225035", }, ["subjectLabel"] = table#7865 { ["type"] = "literal", ["value"] = "Edge-transitive bi-p-metacirculants of valency p", ["xml:lang"] = "en", }, }, table#7866 { ["itemType"] = table#7867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5227114", }, ["subjectLabel"] = table#7869 { ["type"] = "literal", ["value"] = "Traceability in $\\{K_{1,4},K_{1,4}+e\\}$-free graphs", ["xml:lang"] = "en", }, }, table#7870 { ["itemType"] = table#7871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5227796", }, ["subjectLabel"] = table#7873 { ["type"] = "literal", ["value"] = "Generalized Cayley graphs over polygroups", ["xml:lang"] = "en", }, }, table#7874 { ["itemType"] = table#7875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5484912", }, ["subjectLabel"] = table#7877 { ["type"] = "literal", ["value"] = "COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS", ["xml:lang"] = "en", }, }, table#7878 { ["itemType"] = table#7879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5232290", }, ["subjectLabel"] = table#7881 { ["type"] = "literal", ["value"] = "Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator", ["xml:lang"] = "en", }, }, table#7882 { ["itemType"] = table#7883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5485789", }, ["subjectLabel"] = table#7885 { ["type"] = "literal", ["value"] = "THE TSP AND THE SUM OF ITS MARGINAL VALUES", ["xml:lang"] = "en", }, }, table#7886 { ["itemType"] = table#7887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5486304", }, ["subjectLabel"] = table#7889 { ["type"] = "literal", ["value"] = "Regular subgraphs of random graphs", ["xml:lang"] = "en", }, }, table#7890 { ["itemType"] = table#7891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708501", }, ["subjectLabel"] = table#7893 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708501", }, }, table#7894 { ["itemType"] = table#7895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708525", }, ["subjectLabel"] = table#7897 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708525", }, }, table#7898 { ["itemType"] = table#7899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708596", }, ["subjectLabel"] = table#7901 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708596", }, }, table#7902 { ["itemType"] = table#7903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708622", }, ["subjectLabel"] = table#7905 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5708622", }, }, table#7906 { ["itemType"] = table#7907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5487818", }, ["subjectLabel"] = table#7909 { ["type"] = "literal", ["value"] = "Route discovery with constant memory in oriented planar geometric networks", ["xml:lang"] = "en", }, }, table#7910 { ["itemType"] = table#7911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5234666", }, ["subjectLabel"] = table#7913 { ["type"] = "literal", ["value"] = "Controllability of Coupled Parabolic Systems with Multiple Underactuations, Part 1: Algebraic Solvability", ["xml:lang"] = "en", }, }, table#7914 { ["itemType"] = table#7915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5237593", }, ["subjectLabel"] = table#7917 { ["type"] = "literal", ["value"] = "INDEPENDENT AND IRREDUNDANT CYCLE TRACKING SETS OF A GRAPH: AN EFFICIENT APPROACH TO ELECTRICAL CIRCUIT ANALYSIS", ["xml:lang"] = "en", }, }, table#7918 { ["itemType"] = table#7919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5753224", }, ["subjectLabel"] = table#7921 { ["type"] = "literal", ["value"] = "Ramsey Theorems for Knots, Links and Spatial Graphs", ["xml:lang"] = "en", }, }, table#7922 { ["itemType"] = table#7923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5495476", }, ["subjectLabel"] = table#7925 { ["type"] = "literal", ["value"] = "CAYLEY SUM GRAPHS OF IDEALS OF A COMMUTATIVE RING", ["xml:lang"] = "en", }, }, table#7926 { ["itemType"] = table#7927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5498512", }, ["subjectLabel"] = table#7929 { ["type"] = "literal", ["value"] = "Extremal problem with respect to Merrifield-Simmons index and Hosoya index of a class of polygonal chains", ["xml:lang"] = "en", }, }, table#7930 { ["itemType"] = table#7931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5498571", }, ["subjectLabel"] = table#7933 { ["type"] = "literal", ["value"] = "The annihilator graph of a commutative semigroup", ["xml:lang"] = "en", }, }, table#7934 { ["itemType"] = table#7935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5244224", }, ["subjectLabel"] = table#7937 { ["type"] = "literal", ["value"] = "The harmonic index of two-trees and quasi-tree graphs", ["xml:lang"] = "en", }, }, table#7938 { ["itemType"] = table#7939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5245848", }, ["subjectLabel"] = table#7941 { ["type"] = "literal", ["value"] = "Some new results on strong integer additive set-indexers of graphs", ["xml:lang"] = "en", }, }, table#7942 { ["itemType"] = table#7943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5245851", }, ["subjectLabel"] = table#7945 { ["type"] = "literal", ["value"] = "A generalization of commuting graphs", ["xml:lang"] = "en", }, }, table#7946 { ["itemType"] = table#7947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5853154", }, ["subjectLabel"] = table#7949 { ["type"] = "literal", ["value"] = "New Clusterization Method Based on Graph Connectivity Search", ["xml:lang"] = "en", }, }, table#7950 { ["itemType"] = table#7951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5254106", }, ["subjectLabel"] = table#7953 { ["type"] = "literal", ["value"] = "Distributed MPC for urban traffic networks: A simulation‐based performance analysis", ["xml:lang"] = "en", }, }, table#7954 { ["itemType"] = table#7955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5858272", }, ["subjectLabel"] = table#7957 { ["type"] = "literal", ["value"] = "On the multiplicative sum Zagreb index of graphs with some given parameters", ["xml:lang"] = "en", }, }, table#7958 { ["itemType"] = table#7959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5261050", }, ["subjectLabel"] = table#7961 { ["type"] = "literal", ["value"] = "Star decomposition of graphs", ["xml:lang"] = "en", }, }, table#7962 { ["itemType"] = table#7963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5266208", }, ["subjectLabel"] = table#7965 { ["type"] = "literal", ["value"] = "Consensus control of flexible-joint robots", ["xml:lang"] = "en", }, }, table#7966 { ["itemType"] = table#7967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5269858", }, ["subjectLabel"] = table#7969 { ["type"] = "literal", ["value"] = "Optimal Partition in Terms of Independent Random Vectors of Any Non-Gaussian Vector Defined by a Set of Realizations", ["xml:lang"] = "en", }, }, table#7970 { ["itemType"] = table#7971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5272562", }, ["subjectLabel"] = table#7973 { ["type"] = "literal", ["value"] = "On the line graphs of zero-divisor graphs of posets", ["xml:lang"] = "en", }, }, table#7974 { ["itemType"] = table#7975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5272634", }, ["subjectLabel"] = table#7977 { ["type"] = "literal", ["value"] = "Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs", ["xml:lang"] = "en", }, }, table#7978 { ["itemType"] = table#7979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2172390", }, ["subjectLabel"] = table#7981 { ["type"] = "literal", ["value"] = "Decomposition of graphs with constraint on minimum degree", ["xml:lang"] = "en", }, }, table#7982 { ["itemType"] = table#7983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2172841", }, ["subjectLabel"] = table#7985 { ["type"] = "literal", ["value"] = "Maximum number of subtrees in cacti and block graphs", ["xml:lang"] = "en", }, }, table#7986 { ["itemType"] = table#7987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2175055", }, ["subjectLabel"] = table#7989 { ["type"] = "literal", ["value"] = "Local antimagic orientation of graphs", ["xml:lang"] = "en", }, }, table#7990 { ["itemType"] = table#7991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2175236", }, ["subjectLabel"] = table#7993 { ["type"] = "literal", ["value"] = "On factorable bigraphic pairs", ["xml:lang"] = "en", }, }, table#7994 { ["itemType"] = table#7995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#7996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2175238", }, ["subjectLabel"] = table#7997 { ["type"] = "literal", ["value"] = "Regular colorings in regular graphs", ["xml:lang"] = "en", }, }, table#7998 { ["itemType"] = table#7999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2175791", }, ["subjectLabel"] = table#8001 { ["type"] = "literal", ["value"] = "Extendability and criticality in matching theory", ["xml:lang"] = "en", }, }, table#8002 { ["itemType"] = table#8003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2175797", }, ["subjectLabel"] = table#8005 { ["type"] = "literal", ["value"] = "Long cycles passing through a linear forest", ["xml:lang"] = "en", }, }, table#8006 { ["itemType"] = table#8007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2176148", }, ["subjectLabel"] = table#8009 { ["type"] = "literal", ["value"] = "Weak saturation numbers of \$K_{2, t}\$ and \$K_p \\bigcup K_q\$", ["xml:lang"] = "en", }, }, table#8010 { ["itemType"] = table#8011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2177857", }, ["subjectLabel"] = table#8013 { ["type"] = "literal", ["value"] = "Bipancyclicism and bipanconnectivity in bipartite graphs", ["xml:lang"] = "en", }, }, table#8014 { ["itemType"] = table#8015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2178587", }, ["subjectLabel"] = table#8017 { ["type"] = "literal", ["value"] = "Aggregate play and welfare in strategic interactions on networks", ["xml:lang"] = "en", }, }, table#8018 { ["itemType"] = table#8019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2178745", }, ["subjectLabel"] = table#8021 { ["type"] = "literal", ["value"] = "Heuristic method to determine lucky \$k\$-polynomials for \$k\$-colorable graphs", ["xml:lang"] = "en", }, }, table#8022 { ["itemType"] = table#8023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2180726", }, ["subjectLabel"] = table#8025 { ["type"] = "literal", ["value"] = "The watching system as a generalization of identifying code", ["xml:lang"] = "en", }, }, table#8026 { ["itemType"] = table#8027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2181224", }, ["subjectLabel"] = table#8029 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles", ["xml:lang"] = "en", }, }, table#8030 { ["itemType"] = table#8031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2181235", }, ["subjectLabel"] = table#8033 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions", ["xml:lang"] = "en", }, }, table#8034 { ["itemType"] = table#8035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2182200", }, ["subjectLabel"] = table#8037 { ["type"] = "literal", ["value"] = "Hamiltonicity of edge-chromatic critical graphs", ["xml:lang"] = "en", }, }, table#8038 { ["itemType"] = table#8039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2183733", }, ["subjectLabel"] = table#8041 { ["type"] = "literal", ["value"] = "Vertex coloring of a graph for memory constrained scenarios", ["xml:lang"] = "en", }, }, table#8042 { ["itemType"] = table#8043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2184681", }, ["subjectLabel"] = table#8045 { ["type"] = "literal", ["value"] = "On hyper-Hamiltonicity in graphs", ["xml:lang"] = "en", }, }, table#8046 { ["itemType"] = table#8047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2185736", }, ["subjectLabel"] = table#8049 { ["type"] = "literal", ["value"] = "Embedding planar 5-graphs in three pages", ["xml:lang"] = "en", }, }, table#8050 { ["itemType"] = table#8051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2185920", }, ["subjectLabel"] = table#8053 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total coloring of IC-planar graphs", ["xml:lang"] = "en", }, }, table#8054 { ["itemType"] = table#8055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2185930", }, ["subjectLabel"] = table#8057 { ["type"] = "literal", ["value"] = "Disjoint directed cycles in directed graphs", ["xml:lang"] = "en", }, }, table#8058 { ["itemType"] = table#8059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2188994", }, ["subjectLabel"] = table#8061 { ["type"] = "literal", ["value"] = "A note on spanning trees with a specified degree sequence", ["xml:lang"] = "en", }, }, table#8062 { ["itemType"] = table#8063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2189394", }, ["subjectLabel"] = table#8065 { ["type"] = "literal", ["value"] = "Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering", ["xml:lang"] = "en", }, }, table#8066 { ["itemType"] = table#8067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2192080", }, ["subjectLabel"] = table#8069 { ["type"] = "literal", ["value"] = "Further results on the Merrifield-Simmons index", ["xml:lang"] = "en", }, }, table#8070 { ["itemType"] = table#8071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2192095", }, ["subjectLabel"] = table#8073 { ["type"] = "literal", ["value"] = "Generalized bent Boolean functions and strongly regular Cayley graphs", ["xml:lang"] = "en", }, }, table#8074 { ["itemType"] = table#8075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2192105", }, ["subjectLabel"] = table#8077 { ["type"] = "literal", ["value"] = "On the Kirchhoff index of bipartite graphs with given diameters", ["xml:lang"] = "en", }, }, table#8078 { ["itemType"] = table#8079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2192121", }, ["subjectLabel"] = table#8081 { ["type"] = "literal", ["value"] = "On the structure of 4-regular planar well-covered graphs", ["xml:lang"] = "en", }, }, table#8082 { ["itemType"] = table#8083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2192131", }, ["subjectLabel"] = table#8085 { ["type"] = "literal", ["value"] = "On the number of edges in some graphs", ["xml:lang"] = "en", }, }, table#8086 { ["itemType"] = table#8087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2192380", }, ["subjectLabel"] = table#8089 { ["type"] = "literal", ["value"] = "Fault tolerance of hypercube like networks: spanning laceability under edge faults", ["xml:lang"] = "en", }, }, table#8090 { ["itemType"] = table#8091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2194500", }, ["subjectLabel"] = table#8093 { ["type"] = "literal", ["value"] = "QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field", ["xml:lang"] = "en", }, }, table#8094 { ["itemType"] = table#8095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2194524", }, ["subjectLabel"] = table#8097 { ["type"] = "literal", ["value"] = "Super edge-connectivity and zeroth-order Randić index", ["xml:lang"] = "en", }, }, table#8098 { ["itemType"] = table#8099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2194528", }, ["subjectLabel"] = table#8101 { ["type"] = "literal", ["value"] = "The list edge coloring and list total coloring of planar graphs with maximum degree at least 7", ["xml:lang"] = "en", }, }, table#8102 { ["itemType"] = table#8103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2194539", }, ["subjectLabel"] = table#8105 { ["type"] = "literal", ["value"] = "On a total version of 1-2-3 conjecture", ["xml:lang"] = "en", }, }, table#8106 { ["itemType"] = table#8107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2194737", }, ["subjectLabel"] = table#8109 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing index of sparse graphs", ["xml:lang"] = "en", }, }, table#8110 { ["itemType"] = table#8111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2197419", }, ["subjectLabel"] = table#8113 { ["type"] = "literal", ["value"] = "Comparative results and bounds for the eccentric-adjacency index", ["xml:lang"] = "en", }, }, table#8114 { ["itemType"] = table#8115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2197435", }, ["subjectLabel"] = table#8117 { ["type"] = "literal", ["value"] = "On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2", ["xml:lang"] = "en", }, }, table#8118 { ["itemType"] = table#8119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2197473", }, ["subjectLabel"] = table#8121 { ["type"] = "literal", ["value"] = "Intersection graph of maximal stars", ["xml:lang"] = "en", }, }, table#8122 { ["itemType"] = table#8123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2198356", }, ["subjectLabel"] = table#8125 { ["type"] = "literal", ["value"] = "Uniqueness of Gibbs fields with unbounded random interactions on unbounded degree graphs", ["xml:lang"] = "en", }, }, table#8126 { ["itemType"] = table#8127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2200924", }, ["subjectLabel"] = table#8129 { ["type"] = "literal", ["value"] = "Edge-transitive bi-Cayley graphs", ["xml:lang"] = "en", }, }, table#8130 { ["itemType"] = table#8131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2200925", }, ["subjectLabel"] = table#8133 { ["type"] = "literal", ["value"] = "Circular flows via extended Tutte orientations", ["xml:lang"] = "en", }, }, table#8134 { ["itemType"] = table#8135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2200929", }, ["subjectLabel"] = table#8137 { ["type"] = "literal", ["value"] = "Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five", ["xml:lang"] = "en", }, }, table#8138 { ["itemType"] = table#8139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2201048", }, ["subjectLabel"] = table#8141 { ["type"] = "literal", ["value"] = "Spectral properties of inverse sum indeg index of graphs", ["xml:lang"] = "en", }, }, table#8142 { ["itemType"] = table#8143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2207873", }, ["subjectLabel"] = table#8145 { ["type"] = "literal", ["value"] = "A note on the interpretation of the efficiency centrality", ["xml:lang"] = "en", }, }, table#8146 { ["itemType"] = table#8147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2208247", }, ["subjectLabel"] = table#8149 { ["type"] = "literal", ["value"] = "Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs", ["xml:lang"] = "en", }, }, table#8150 { ["itemType"] = table#8151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2208363", }, ["subjectLabel"] = table#8153 { ["type"] = "literal", ["value"] = "On conjecture of Merrifield-Simmons index", ["xml:lang"] = "en", }, }, table#8154 { ["itemType"] = table#8155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2208368", }, ["subjectLabel"] = table#8157 { ["type"] = "literal", ["value"] = "Symmetric property and reliability of locally twisted cubes", ["xml:lang"] = "en", }, }, table#8158 { ["itemType"] = table#8159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2212238", }, ["subjectLabel"] = table#8161 { ["type"] = "literal", ["value"] = "Vertex and edge Padmakar-Ivan indices of unitary Cayley graphs", ["xml:lang"] = "en", }, }, table#8162 { ["itemType"] = table#8163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2214315", }, ["subjectLabel"] = table#8165 { ["type"] = "literal", ["value"] = "The crossing number of Cartesian product of 5-wheel with any tree", ["xml:lang"] = "en", }, }, table#8166 { ["itemType"] = table#8167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2214317", }, ["subjectLabel"] = table#8169 { ["type"] = "literal", ["value"] = "List edge coloring of planar graphs without 6-cycles with two chords", ["xml:lang"] = "en", }, }, table#8170 { ["itemType"] = table#8171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2215106", }, ["subjectLabel"] = table#8173 { ["type"] = "literal", ["value"] = "Consensus reaching in social network DeGroot model: the roles of the self-confidence and node degree", ["xml:lang"] = "en", }, }, table#8174 { ["itemType"] = table#8175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2215975", }, ["subjectLabel"] = table#8177 { ["type"] = "literal", ["value"] = "Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model", ["xml:lang"] = "en", }, }, table#8178 { ["itemType"] = table#8179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2219196", }, ["subjectLabel"] = table#8181 { ["type"] = "literal", ["value"] = "A graph approach for fuzzy-rough feature selection", ["xml:lang"] = "en", }, }, table#8182 { ["itemType"] = table#8183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2219958", }, ["subjectLabel"] = table#8185 { ["type"] = "literal", ["value"] = "Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs", ["xml:lang"] = "en", }, }, table#8186 { ["itemType"] = table#8187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2219970", }, ["subjectLabel"] = table#8189 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24", ["xml:lang"] = "en", }, }, table#8190 { ["itemType"] = table#8191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2221920", }, ["subjectLabel"] = table#8193 { ["type"] = "literal", ["value"] = "A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture", ["xml:lang"] = "en", }, }, table#8194 { ["itemType"] = table#8195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2223450", }, ["subjectLabel"] = table#8197 { ["type"] = "literal", ["value"] = "Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs", ["xml:lang"] = "en", }, }, table#8198 { ["itemType"] = table#8199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2223689", }, ["subjectLabel"] = table#8201 { ["type"] = "literal", ["value"] = "The sum necessary to ensure that a degree sequence pair has an \$a\$-connected realization", ["xml:lang"] = "en", }, }, table#8202 { ["itemType"] = table#8203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2225457", }, ["subjectLabel"] = table#8205 { ["type"] = "literal", ["value"] = "Finite 3-set-homogeneous graphs", ["xml:lang"] = "en", }, }, table#8206 { ["itemType"] = table#8207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2226467", }, ["subjectLabel"] = table#8209 { ["type"] = "literal", ["value"] = "On the multiplicities of normalized Laplacian eigenvalues of graphs", ["xml:lang"] = "en", }, }, table#8210 { ["itemType"] = table#8211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2227112", }, ["subjectLabel"] = table#8213 { ["type"] = "literal", ["value"] = "On \$(p, 1)\$-total labelling of some 1-planar graphs", ["xml:lang"] = "en", }, }, table#8214 { ["itemType"] = table#8215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2227977", }, ["subjectLabel"] = table#8217 { ["type"] = "literal", ["value"] = "On vertex-disjoint triangles in tripartite graphs and multigraphs", ["xml:lang"] = "en", }, }, table#8218 { ["itemType"] = table#8219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2227997", }, ["subjectLabel"] = table#8221 { ["type"] = "literal", ["value"] = "Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs", ["xml:lang"] = "en", }, }, table#8222 { ["itemType"] = table#8223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2229516", }, ["subjectLabel"] = table#8225 { ["type"] = "literal", ["value"] = "No signed graph with the nullity \$\\eta(G,\\sigma)=|V(G)|-2m(G)+2c(G)-1\$", ["xml:lang"] = "en", }, }, table#8226 { ["itemType"] = table#8227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2230025", }, ["subjectLabel"] = table#8229 { ["type"] = "literal", ["value"] = "Perfect matchings in random octagonal chain graphs", ["xml:lang"] = "en", }, }, table#8230 { ["itemType"] = table#8231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2231705", }, ["subjectLabel"] = table#8233 { ["type"] = "literal", ["value"] = "Energy and inertia of the eccentricity matrix of coalescence of graphs", ["xml:lang"] = "en", }, }, table#8234 { ["itemType"] = table#8235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2231738", }, ["subjectLabel"] = table#8237 { ["type"] = "literal", ["value"] = "The Turán number for the edge blow-up of trees", ["xml:lang"] = "en", }, }, table#8238 { ["itemType"] = table#8239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2231772", }, ["subjectLabel"] = table#8241 { ["type"] = "literal", ["value"] = "The number of subtrees in graphs with given number of cut edges", ["xml:lang"] = "en", }, }, table#8242 { ["itemType"] = table#8243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2235242", }, ["subjectLabel"] = table#8245 { ["type"] = "literal", ["value"] = "New comments on ``A Hamilton sufficient condition for completely independent spanning tree''", ["xml:lang"] = "en", }, }, table#8246 { ["itemType"] = table#8247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2236356", }, ["subjectLabel"] = table#8249 { ["type"] = "literal", ["value"] = "Confluence number of certain derivative graphs", ["xml:lang"] = "en", }, }, table#8250 { ["itemType"] = table#8251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2236577", }, ["subjectLabel"] = table#8253 { ["type"] = "literal", ["value"] = "On transversal numbers of intersecting straight line systems and intersecting segment systems", ["xml:lang"] = "en", }, }, table#8254 { ["itemType"] = table#8255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2237122", }, ["subjectLabel"] = table#8257 { ["type"] = "literal", ["value"] = "Limited approximate bisimulations and the corresponding rough approximations", ["xml:lang"] = "en", }, }, table#8258 { ["itemType"] = table#8259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2237229", }, ["subjectLabel"] = table#8261 { ["type"] = "literal", ["value"] = "The Turán number of \$k \\cdot S_\\ell \$", ["xml:lang"] = "en", }, }, table#8262 { ["itemType"] = table#8263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2239001", }, ["subjectLabel"] = table#8265 { ["type"] = "literal", ["value"] = "The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs", ["xml:lang"] = "en", }, }, table#8266 { ["itemType"] = table#8267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2239035", }, ["subjectLabel"] = table#8269 { ["type"] = "literal", ["value"] = "On \$(p, 1)\$-total labelling of NIC-planar graphs", ["xml:lang"] = "en", }, }, table#8270 { ["itemType"] = table#8271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2240657", }, ["subjectLabel"] = table#8273 { ["type"] = "literal", ["value"] = "Total-coloring of sparse graphs with maximum degree 6", ["xml:lang"] = "en", }, }, table#8274 { ["itemType"] = table#8275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2241670", }, ["subjectLabel"] = table#8277 { ["type"] = "literal", ["value"] = "Classification of groups according to the number of end vertices in the coprime graph", ["xml:lang"] = "en", }, }, table#8278 { ["itemType"] = table#8279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2242377", }, ["subjectLabel"] = table#8281 { ["type"] = "literal", ["value"] = "Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions", ["xml:lang"] = "en", }, }, table#8282 { ["itemType"] = table#8283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2242842", }, ["subjectLabel"] = table#8285 { ["type"] = "literal", ["value"] = "The general position number of Cartesian products involving a factor with small diameter", ["xml:lang"] = "en", }, }, table#8286 { ["itemType"] = table#8287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2243288", }, ["subjectLabel"] = table#8289 { ["type"] = "literal", ["value"] = "Some new results on the Turán number of star forests", ["xml:lang"] = "en", }, }, table#8290 { ["itemType"] = table#8291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2243341", }, ["subjectLabel"] = table#8293 { ["type"] = "literal", ["value"] = "On the extensional eigenvalues of graphs", ["xml:lang"] = "en", }, }, table#8294 { ["itemType"] = table#8295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2244876", }, ["subjectLabel"] = table#8297 { ["type"] = "literal", ["value"] = "On the extreme points of a family of matrices related to a theorem of Birkhoff", ["xml:lang"] = "en", }, }, table#8298 { ["itemType"] = table#8299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2245939", }, ["subjectLabel"] = table#8301 { ["type"] = "literal", ["value"] = "The generalized burning number of graphs", ["xml:lang"] = "en", }, }, table#8302 { ["itemType"] = table#8303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2246043", }, ["subjectLabel"] = table#8305 { ["type"] = "literal", ["value"] = "On Sombor index of trees", ["xml:lang"] = "en", }, }, table#8306 { ["itemType"] = table#8307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2249043", }, ["subjectLabel"] = table#8309 { ["type"] = "literal", ["value"] = "On grids in topological graphs", ["xml:lang"] = "en", }, }, table#8310 { ["itemType"] = table#8311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2250761", }, ["subjectLabel"] = table#8313 { ["type"] = "literal", ["value"] = "Spectral radius and signless Laplacian spectral radius of strongly connected digraphs", ["xml:lang"] = "en", }, }, table#8314 { ["itemType"] = table#8315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2250856", }, ["subjectLabel"] = table#8317 { ["type"] = "literal", ["value"] = "The regular graph of a commutative ring", ["xml:lang"] = "en", }, }, table#8318 { ["itemType"] = table#8319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2250948", }, ["subjectLabel"] = table#8321 { ["type"] = "literal", ["value"] = "On graphs with at least three distance eigenvalues less than \$-1\$", ["xml:lang"] = "en", }, }, table#8322 { ["itemType"] = table#8323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2254926", }, ["subjectLabel"] = table#8325 { ["type"] = "literal", ["value"] = "The chromatic number of the complementary graph to a simple graph associated with a commutative ring", ["xml:lang"] = "en", }, }, table#8326 { ["itemType"] = table#8327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2256578", }, ["subjectLabel"] = table#8329 { ["type"] = "literal", ["value"] = "The cycle structure for directed graphs on surfaces", ["xml:lang"] = "en", }, }, table#8330 { ["itemType"] = table#8331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2256703", }, ["subjectLabel"] = table#8333 { ["type"] = "literal", ["value"] = "Dynamic proper colorings of a graph", ["xml:lang"] = "en", }, }, table#8334 { ["itemType"] = table#8335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2257000", }, ["subjectLabel"] = table#8337 { ["type"] = "literal", ["value"] = "Zero divisor graph of a lattice with respect to an ideal", ["xml:lang"] = "en", }, }, table#8338 { ["itemType"] = table#8339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2260637", }, ["subjectLabel"] = table#8341 { ["type"] = "literal", ["value"] = "Lai's conditions for spanning and dominating closed trails", ["xml:lang"] = "en", }, }, table#8342 { ["itemType"] = table#8343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2261377", }, ["subjectLabel"] = table#8345 { ["type"] = "literal", ["value"] = "On the structure of quadrilateral brane tilings", ["xml:lang"] = "en", }, }, table#8346 { ["itemType"] = table#8347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2266024", }, ["subjectLabel"] = table#8349 { ["type"] = "literal", ["value"] = "Cycles through ten vertices in 3-connected cubic graphs", ["xml:lang"] = "en", }, }, table#8350 { ["itemType"] = table#8351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2267822", }, ["subjectLabel"] = table#8353 { ["type"] = "literal", ["value"] = "Ordering trees with given pendent vertices with respect to Merrifield-Simmons indices and Hosoya indices", ["xml:lang"] = "en", }, }, table#8354 { ["itemType"] = table#8355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2274086", }, ["subjectLabel"] = table#8357 { ["type"] = "literal", ["value"] = "No graph with nullity \$\\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\$", ["xml:lang"] = "en", }, }, table#8358 { ["itemType"] = table#8359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2274182", }, ["subjectLabel"] = table#8361 { ["type"] = "literal", ["value"] = "The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs", ["xml:lang"] = "en", }, }, table#8362 { ["itemType"] = table#8363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2274771", }, ["subjectLabel"] = table#8365 { ["type"] = "literal", ["value"] = "Heptavalent symmetric graphs of order \$24p\$", ["xml:lang"] = "en", }, }, table#8366 { ["itemType"] = table#8367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2277490", }, ["subjectLabel"] = table#8369 { ["type"] = "literal", ["value"] = "On the classification of plane graphs representing structurally stable rational Newton flows", ["xml:lang"] = "en", }, }, table#8370 { ["itemType"] = table#8371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2278714", }, ["subjectLabel"] = table#8373 { ["type"] = "literal", ["value"] = "Super-edge-connectivity and zeroth-order Randić index", ["xml:lang"] = "en", }, }, table#8374 { ["itemType"] = table#8375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2278915", }, ["subjectLabel"] = table#8377 { ["type"] = "literal", ["value"] = "Rationalizable strategies in random games", ["xml:lang"] = "en", }, }, table#8378 { ["itemType"] = table#8379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5880306", }, ["subjectLabel"] = table#8381 { ["type"] = "literal", ["value"] = "Cayley subspace sum graph of vector spaces", ["xml:lang"] = "en", }, }, table#8382 { ["itemType"] = table#8383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5884269", }, ["subjectLabel"] = table#8385 { ["type"] = "literal", ["value"] = "On the Comaximal (Ideal) Graph Associated With Amalgamated Algebra", ["xml:lang"] = "en", }, }, table#8386 { ["itemType"] = table#8387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5886104", }, ["subjectLabel"] = table#8389 { ["type"] = "literal", ["value"] = "A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles", ["xml:lang"] = "en", }, }, table#8390 { ["itemType"] = table#8391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5887708", }, ["subjectLabel"] = table#8393 { ["type"] = "literal", ["value"] = "The general spectral radii of (multicone-)graphs with prescribed degree sequence", ["xml:lang"] = "en", }, }, table#8394 { ["itemType"] = table#8395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5889963", }, ["subjectLabel"] = table#8397 { ["type"] = "literal", ["value"] = "On the local antimagic chromatic number of the lexicographic product of graphs", ["xml:lang"] = "en", }, }, table#8398 { ["itemType"] = table#8399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5889979", }, ["subjectLabel"] = table#8401 { ["type"] = "literal", ["value"] = "The largest eigenvalue conditions for Hamiltonian and traceable graphs", ["xml:lang"] = "en", }, }, table#8402 { ["itemType"] = table#8403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6038695", }, ["subjectLabel"] = table#8405 { ["type"] = "literal", ["value"] = "The partial diagnosability of interconnection networks under the hybrid PMC model", ["xml:lang"] = "en", }, }, table#8406 { ["itemType"] = table#8407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6041570", }, ["subjectLabel"] = table#8409 { ["type"] = "literal", ["value"] = "On regular 2-connected 2-path Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#8410 { ["itemType"] = table#8411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6041862", }, ["subjectLabel"] = table#8413 { ["type"] = "literal", ["value"] = "Local Dirac's condition on the existence of 2-factor", ["xml:lang"] = "en", }, }, table#8414 { ["itemType"] = table#8415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6041867", }, ["subjectLabel"] = table#8417 { ["type"] = "literal", ["value"] = "Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs", ["xml:lang"] = "en", }, }, table#8418 { ["itemType"] = table#8419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6044741", }, ["subjectLabel"] = table#8421 { ["type"] = "literal", ["value"] = "Improved asymptotically optimal error correcting codes for avoidance crosstalk type-IV on-chip data buses", ["xml:lang"] = "en", }, }, table#8422 { ["itemType"] = table#8423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6045139", }, ["subjectLabel"] = table#8425 { ["type"] = "literal", ["value"] = "Upper bounds on the chromatic polynomial of a connected graph with fixed clique number", ["xml:lang"] = "en", }, }, table#8426 { ["itemType"] = table#8427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6047191", }, ["subjectLabel"] = table#8429 { ["type"] = "literal", ["value"] = "Star fault tolerance of hypercube", ["xml:lang"] = "en", }, }, table#8430 { ["itemType"] = table#8431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6047955", }, ["subjectLabel"] = table#8433 { ["type"] = "literal", ["value"] = "Strong 3‐Flow Conjecture for projective planar graphs", ["xml:lang"] = "en", }, }, table#8434 { ["itemType"] = table#8435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6048438", }, ["subjectLabel"] = table#8437 { ["type"] = "literal", ["value"] = "New transmission irregular chemical graphs", ["xml:lang"] = "en", }, }, table#8438 { ["itemType"] = table#8439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6048445", }, ["subjectLabel"] = table#8441 { ["type"] = "literal", ["value"] = "On the \$A_\\alpha \$-spectral radius of graphs with given size", ["xml:lang"] = "en", }, }, table#8442 { ["itemType"] = table#8443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6053962", }, ["subjectLabel"] = table#8445 { ["type"] = "literal", ["value"] = "Complete forcing numbers of complete and almost-complete multipartite graphs", ["xml:lang"] = "en", }, }, table#8446 { ["itemType"] = table#8447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6055401", }, ["subjectLabel"] = table#8449 { ["type"] = "literal", ["value"] = "Clique‐convergence is undecidable for automatic graphs", ["xml:lang"] = "en", }, }, table#8450 { ["itemType"] = table#8451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6057900", }, ["subjectLabel"] = table#8453 { ["type"] = "literal", ["value"] = "Tree embeddings and tree‐star Ramsey numbers", ["xml:lang"] = "en", }, }, table#8454 { ["itemType"] = table#8455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6059101", }, ["subjectLabel"] = table#8457 { ["type"] = "literal", ["value"] = "On k-restricted connectivity of direct product of graphs", ["xml:lang"] = "en", }, }, table#8458 { ["itemType"] = table#8459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6059107", }, ["subjectLabel"] = table#8461 { ["type"] = "literal", ["value"] = "Application of near approximations in Cayley graphs", ["xml:lang"] = "en", }, }, table#8462 { ["itemType"] = table#8463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6065850", }, ["subjectLabel"] = table#8465 { ["type"] = "literal", ["value"] = "An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs", ["xml:lang"] = "en", }, }, table#8466 { ["itemType"] = table#8467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6065861", }, ["subjectLabel"] = table#8469 { ["type"] = "literal", ["value"] = "New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts", ["xml:lang"] = "en", }, }, table#8470 { ["itemType"] = table#8471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6068196", }, ["subjectLabel"] = table#8473 { ["type"] = "literal", ["value"] = "Independence numbers of polyhedral graphs", ["xml:lang"] = "en", }, }, table#8474 { ["itemType"] = table#8475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6069166", }, ["subjectLabel"] = table#8477 { ["type"] = "literal", ["value"] = "Group connectivity of graphs satisfying the Chvátal-condition", ["xml:lang"] = "en", }, }, table#8478 { ["itemType"] = table#8479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6076382", }, ["subjectLabel"] = table#8481 { ["type"] = "literal", ["value"] = "Parallel line identification for line-implicit-solvers", ["xml:lang"] = "en", }, }, table#8482 { ["itemType"] = table#8483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6079301", }, ["subjectLabel"] = table#8485 { ["type"] = "literal", ["value"] = "The simultaneous fractional dimension of graph families", ["xml:lang"] = "en", }, }, table#8486 { ["itemType"] = table#8487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6084886", }, ["subjectLabel"] = table#8489 { ["type"] = "literal", ["value"] = "Extremal normalized Laplacian spectral radii of graphs", ["xml:lang"] = "en", }, }, table#8490 { ["itemType"] = table#8491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6085209", }, ["subjectLabel"] = table#8493 { ["type"] = "literal", ["value"] = "Sudoku number of graphs", ["xml:lang"] = "en", }, }, table#8494 { ["itemType"] = table#8495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6086217", }, ["subjectLabel"] = table#8497 { ["type"] = "literal", ["value"] = "A generalization of group divisible t $t$‐designs", ["xml:lang"] = "en", }, }, table#8498 { ["itemType"] = table#8499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6089069", }, ["subjectLabel"] = table#8501 { ["type"] = "literal", ["value"] = "Differential in complementary prisms", ["xml:lang"] = "en", }, }, table#8502 { ["itemType"] = table#8503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6090292", }, ["subjectLabel"] = table#8505 { ["type"] = "literal", ["value"] = "On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves", ["xml:lang"] = "en", }, }, table#8506 { ["itemType"] = table#8507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6090821", }, ["subjectLabel"] = table#8509 { ["type"] = "literal", ["value"] = "On the general position numbers of maximal outerplane graphs", ["xml:lang"] = "en", }, }, table#8510 { ["itemType"] = table#8511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5866982", }, ["subjectLabel"] = table#8513 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5866982", }, }, table#8514 { ["itemType"] = table#8515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6092625", }, ["subjectLabel"] = table#8517 { ["type"] = "literal", ["value"] = "An integer program for positive semidefinite zero forcing in graphs", ["xml:lang"] = "en", }, }, table#8518 { ["itemType"] = table#8519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6092650", }, ["subjectLabel"] = table#8521 { ["type"] = "literal", ["value"] = "Rational roots of all‐terminal reliability", ["xml:lang"] = "en", }, }, table#8522 { ["itemType"] = table#8523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6093374", }, ["subjectLabel"] = table#8525 { ["type"] = "literal", ["value"] = "On finding the best and worst orientations for the metric dimension", ["xml:lang"] = "en", }, }, table#8526 { ["itemType"] = table#8527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6093997", }, ["subjectLabel"] = table#8529 { ["type"] = "literal", ["value"] = "Degree conditions on copies of forests in graphs", ["xml:lang"] = "en", }, }, table#8530 { ["itemType"] = table#8531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6094039", }, ["subjectLabel"] = table#8533 { ["type"] = "literal", ["value"] = "Edge coloring graphs with large minimum degree", ["xml:lang"] = "en", }, }, table#8534 { ["itemType"] = table#8535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6094044", }, ["subjectLabel"] = table#8537 { ["type"] = "literal", ["value"] = "Erdős–Pósa property of obstructions to interval graphs", ["xml:lang"] = "en", }, }, table#8538 { ["itemType"] = table#8539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6094714", }, ["subjectLabel"] = table#8541 { ["type"] = "literal", ["value"] = "Two completely independent spanning trees of split graphs", ["xml:lang"] = "en", }, }, table#8542 { ["itemType"] = table#8543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6095600", }, ["subjectLabel"] = table#8545 { ["type"] = "literal", ["value"] = "Consensus manipulation in social network group decision making with value-based opinion evolution", ["xml:lang"] = "en", }, }, table#8546 { ["itemType"] = table#8547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5867383", }, ["subjectLabel"] = table#8549 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5867383", }, }, table#8550 { ["itemType"] = table#8551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5878398", }, ["subjectLabel"] = table#8553 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5878398", }, }, table#8554 { ["itemType"] = table#8555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5878778", }, ["subjectLabel"] = table#8557 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5878778", }, }, table#8558 { ["itemType"] = table#8559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5881545", }, ["subjectLabel"] = table#8561 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5881545", }, }, table#8562 { ["itemType"] = table#8563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6044652", }, ["subjectLabel"] = table#8565 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6044652", }, }, table#8566 { ["itemType"] = table#8567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6046265", }, ["subjectLabel"] = table#8569 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6046265", }, }, table#8570 { ["itemType"] = table#8571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6072049", }, ["subjectLabel"] = table#8573 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6072049", }, }, table#8574 { ["itemType"] = table#8575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6084397", }, ["subjectLabel"] = table#8577 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6084397", }, }, table#8578 { ["itemType"] = table#8579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5890607", }, ["subjectLabel"] = table#8581 { ["type"] = "literal", ["value"] = "Vertex-fault-tolerant cycles embedding on enhanced hypercube networks", ["xml:lang"] = "en", }, }, table#8582 { ["itemType"] = table#8583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5891169", }, ["subjectLabel"] = table#8585 { ["type"] = "literal", ["value"] = "Hamiltonian connectedness in claw-free graphs", ["xml:lang"] = "en", }, }, table#8586 { ["itemType"] = table#8587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5878181", }, ["subjectLabel"] = table#8589 { ["type"] = "literal", ["value"] = "Line graphs associated to annihilating-ideal graph attached to lattices of genus one", ["xml:lang"] = "en", }, }, table#8590 { ["itemType"] = table#8591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5897169", }, ["subjectLabel"] = table#8593 { ["type"] = "literal", ["value"] = "The number of spanning trees of a graph", ["xml:lang"] = "en", }, }, table#8594 { ["itemType"] = table#8595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5916058", }, ["subjectLabel"] = table#8597 { ["type"] = "literal", ["value"] = "Steinberg-like theorems for backbone colouring", ["xml:lang"] = "en", }, }, table#8598 { ["itemType"] = table#8599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5906406", }, ["subjectLabel"] = table#8601 { ["type"] = "literal", ["value"] = "On integral sum graphs", ["xml:lang"] = "en", }, }, table#8602 { ["itemType"] = table#8603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5902319", }, ["subjectLabel"] = table#8605 { ["type"] = "literal", ["value"] = "On the nullity of bipartite graphs", ["xml:lang"] = "en", }, }, table#8606 { ["itemType"] = table#8607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5939600", }, ["subjectLabel"] = table#8609 { ["type"] = "literal", ["value"] = "TSP tour domination and Hamilton cycle decompositions of regular digraphs", ["xml:lang"] = "en", }, }, table#8610 { ["itemType"] = table#8611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5943374", }, ["subjectLabel"] = table#8613 { ["type"] = "literal", ["value"] = "Cyclic bandwidth sum of graphs", ["xml:lang"] = "en", }, }, table#8614 { ["itemType"] = table#8615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6090541", }, ["subjectLabel"] = table#8617 { ["type"] = "literal", ["value"] = "Traversability, reconfiguration, and reachability in the gadget framework", ["xml:lang"] = "en", }, }, table#8618 { ["itemType"] = table#8619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5946290", }, ["subjectLabel"] = table#8621 { ["type"] = "literal", ["value"] = "On the complexity of the maximum biplanar subgraph problem", ["xml:lang"] = "en", }, }, table#8622 { ["itemType"] = table#8623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5949015", }, ["subjectLabel"] = table#8625 { ["type"] = "literal", ["value"] = "Coverings of graphs and maps, orthogonality, and eigenvectors", ["xml:lang"] = "en", }, }, table#8626 { ["itemType"] = table#8627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5952862", }, ["subjectLabel"] = table#8629 { ["type"] = "literal", ["value"] = "On \$k\$-diameter of \$k\$-connected graphs", ["xml:lang"] = "en", }, }, table#8630 { ["itemType"] = table#8631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5955847", }, ["subjectLabel"] = table#8633 { ["type"] = "literal", ["value"] = "Almost every graph has a fixed edge", ["xml:lang"] = "en", }, }, table#8634 { ["itemType"] = table#8635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5956009", }, ["subjectLabel"] = table#8637 { ["type"] = "literal", ["value"] = "The communication complexity of enumeration, elimination, and selection", ["xml:lang"] = "en", }, }, table#8638 { ["itemType"] = table#8639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5959650", }, ["subjectLabel"] = table#8641 { ["type"] = "literal", ["value"] = "Abelian subgroups of the Torelli group", ["xml:lang"] = "en", }, }, table#8642 { ["itemType"] = table#8643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5961977", }, ["subjectLabel"] = table#8645 { ["type"] = "literal", ["value"] = "A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs", ["xml:lang"] = "en", }, }, table#8646 { ["itemType"] = table#8647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5962521", }, ["subjectLabel"] = table#8649 { ["type"] = "literal", ["value"] = "Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs", ["xml:lang"] = "en", }, }, table#8650 { ["itemType"] = table#8651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5963616", }, ["subjectLabel"] = table#8653 { ["type"] = "literal", ["value"] = "Maximally edge-connected graphs and zeroth-order general Randić index for \$\\alpha\\leq-1\$", ["xml:lang"] = "en", }, }, table#8654 { ["itemType"] = table#8655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5963630", }, ["subjectLabel"] = table#8657 { ["type"] = "literal", ["value"] = "On \$(s,t)\$-relaxed \$L(2,1)\$-labeling of graphs", ["xml:lang"] = "en", }, }, table#8658 { ["itemType"] = table#8659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5963631", }, ["subjectLabel"] = table#8661 { ["type"] = "literal", ["value"] = "Further properties on the degree distance of graphs", ["xml:lang"] = "en", }, }, table#8662 { ["itemType"] = table#8663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5963640", }, ["subjectLabel"] = table#8665 { ["type"] = "literal", ["value"] = "\$L(j,k)\$-labeling number of Cartesian product of path and cycle", ["xml:lang"] = "en", }, }, table#8666 { ["itemType"] = table#8667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5963641", }, ["subjectLabel"] = table#8669 { ["type"] = "literal", ["value"] = "Extremal polyomino chains with respect to general Randić index", ["xml:lang"] = "en", }, }, table#8670 { ["itemType"] = table#8671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5964923", }, ["subjectLabel"] = table#8673 { ["type"] = "literal", ["value"] = "Color degree condition for long rainbow paths in edge-colored graphs", ["xml:lang"] = "en", }, }, table#8674 { ["itemType"] = table#8675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5964986", }, ["subjectLabel"] = table#8677 { ["type"] = "literal", ["value"] = "Decomposition of product graphs into paths and cycles of length four", ["xml:lang"] = "en", }, }, table#8678 { ["itemType"] = table#8679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5964991", }, ["subjectLabel"] = table#8681 { ["type"] = "literal", ["value"] = "Long paths and cycles passing through specified vertices under the average degree condition", ["xml:lang"] = "en", }, }, table#8682 { ["itemType"] = table#8683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5964998", }, ["subjectLabel"] = table#8685 { ["type"] = "literal", ["value"] = "The existence problem of \$k\\mathrm{-}\\gamma_t\$-critical graphs", ["xml:lang"] = "en", }, }, table#8686 { ["itemType"] = table#8687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5965000", }, ["subjectLabel"] = table#8689 { ["type"] = "literal", ["value"] = "\$Z_3\$-connectivity with independent number 2", ["xml:lang"] = "en", }, }, table#8690 { ["itemType"] = table#8691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5920288", }, ["subjectLabel"] = table#8693 { ["type"] = "literal", ["value"] = "Supereulerian graphs and the Petersen graph", ["xml:lang"] = "en", }, }, table#8694 { ["itemType"] = table#8695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5918244", }, ["subjectLabel"] = table#8697 { ["type"] = "literal", ["value"] = "Weak models of distributed computing, with connections to modal logic", ["xml:lang"] = "en", }, }, table#8698 { ["itemType"] = table#8699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5920134", }, ["subjectLabel"] = table#8701 { ["type"] = "literal", ["value"] = "Strong edge-coloring of planar graphs", ["xml:lang"] = "en", }, }, table#8702 { ["itemType"] = table#8703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5967034", }, ["subjectLabel"] = table#8705 { ["type"] = "literal", ["value"] = "A \$[k,k+1]\$-factor containing a given Hamiltonian cycle", ["xml:lang"] = "en", }, }, table#8706 { ["itemType"] = table#8707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5903768", }, ["subjectLabel"] = table#8709 { ["type"] = "literal", ["value"] = "Data transfers in networks with transceivers", ["xml:lang"] = "en", }, }, table#8710 { ["itemType"] = table#8711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5903907", }, ["subjectLabel"] = table#8713 { ["type"] = "literal", ["value"] = "Data transfers in networks with transceivers", ["xml:lang"] = "en", }, }, table#8714 { ["itemType"] = table#8715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5858489", }, ["subjectLabel"] = table#8717 { ["type"] = "literal", ["value"] = "Eigenvalue bounds for some classes of matrices associated with graphs", ["xml:lang"] = "en", }, }, table#8718 { ["itemType"] = table#8719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5861069", }, ["subjectLabel"] = table#8721 { ["type"] = "literal", ["value"] = "The structural index of sensitivity equation systems", ["xml:lang"] = "en", }, }, table#8722 { ["itemType"] = table#8723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5862368", }, ["subjectLabel"] = table#8725 { ["type"] = "literal", ["value"] = "The inertia indices of a signed graph in terms of the inertia indices of its underlying graph", ["xml:lang"] = "en", }, }, table#8726 { ["itemType"] = table#8727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5862606", }, ["subjectLabel"] = table#8729 { ["type"] = "literal", ["value"] = "A linear time algorithm for minimum equitable dominating set in trees", ["xml:lang"] = "en", }, }, table#8730 { ["itemType"] = table#8731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5862678", }, ["subjectLabel"] = table#8733 { ["type"] = "literal", ["value"] = "On the pancyclicity of 1-tough graphs", ["xml:lang"] = "en", }, }, table#8734 { ["itemType"] = table#8735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5864393", }, ["subjectLabel"] = table#8737 { ["type"] = "literal", ["value"] = "On the conditional edge connectivity of double-orbit graphs", ["xml:lang"] = "en", }, }, table#8738 { ["itemType"] = table#8739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5865570", }, ["subjectLabel"] = table#8741 { ["type"] = "literal", ["value"] = "From graph theory to nano topology", ["xml:lang"] = "en", }, }, table#8742 { ["itemType"] = table#8743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5865585", }, ["subjectLabel"] = table#8745 { ["type"] = "literal", ["value"] = "Some topological structures of fractals and their related graphs", ["xml:lang"] = "en", }, }, table#8746 { ["itemType"] = table#8747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5865868", }, ["subjectLabel"] = table#8749 { ["type"] = "literal", ["value"] = "On r- dynamic coloring of the family of bistar graphs", ["xml:lang"] = "en", }, }, table#8750 { ["itemType"] = table#8751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5865894", }, ["subjectLabel"] = table#8753 { ["type"] = "literal", ["value"] = "On b-coloring of central graph of some graphs", ["xml:lang"] = "en", }, }, table#8754 { ["itemType"] = table#8755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5866018", }, ["subjectLabel"] = table#8757 { ["type"] = "literal", ["value"] = "Finding the shortest path for a Hypergraph", ["xml:lang"] = "en", }, }, table#8758 { ["itemType"] = table#8759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5870076", }, ["subjectLabel"] = table#8761 { ["type"] = "literal", ["value"] = "Matrix computations with the Omega calculus", ["xml:lang"] = "en", }, }, table#8762 { ["itemType"] = table#8763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5871599", }, ["subjectLabel"] = table#8765 { ["type"] = "literal", ["value"] = "Complete forcing numbers of graphs", ["xml:lang"] = "en", }, }, table#8766 { ["itemType"] = table#8767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5874607", }, ["subjectLabel"] = table#8769 { ["type"] = "literal", ["value"] = "Clique Number and Girth of the Rough Ideal-Based Rough Edge Cayley Graph", ["xml:lang"] = "en", }, }, table#8770 { ["itemType"] = table#8771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5877109", }, ["subjectLabel"] = table#8773 { ["type"] = "literal", ["value"] = "Using the Exterior Match to Compare Two Entwined Matched Control Groups", ["xml:lang"] = "en", }, }, table#8774 { ["itemType"] = table#8775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5877278", }, ["subjectLabel"] = table#8777 { ["type"] = "literal", ["value"] = "Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L", ["xml:lang"] = "en", }, }, table#8778 { ["itemType"] = table#8779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2358375", }, ["subjectLabel"] = table#8781 { ["type"] = "literal", ["value"] = "Two recursive inequalities for crossing numbers of graphs", ["xml:lang"] = "en", }, }, table#8782 { ["itemType"] = table#8783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2360854", }, ["subjectLabel"] = table#8785 { ["type"] = "literal", ["value"] = "Even factors with a bounded number of components in iterated line graphs", ["xml:lang"] = "en", }, }, table#8786 { ["itemType"] = table#8787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2361354", }, ["subjectLabel"] = table#8789 { ["type"] = "literal", ["value"] = "On \$g\$-extra connectivity of hypercube-like networks", ["xml:lang"] = "en", }, }, table#8790 { ["itemType"] = table#8791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2361541", }, ["subjectLabel"] = table#8793 { ["type"] = "literal", ["value"] = "Projective zero divisor graphs of partially ordered sets", ["xml:lang"] = "en", }, }, table#8794 { ["itemType"] = table#8795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2361728", }, ["subjectLabel"] = table#8797 { ["type"] = "literal", ["value"] = "Annihilator graphs with four vertices", ["xml:lang"] = "en", }, }, table#8798 { ["itemType"] = table#8799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2365177", }, ["subjectLabel"] = table#8801 { ["type"] = "literal", ["value"] = "Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs", ["xml:lang"] = "en", }, }, table#8802 { ["itemType"] = table#8803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2279291", }, ["subjectLabel"] = table#8805 { ["type"] = "literal", ["value"] = "Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs", ["xml:lang"] = "en", }, }, table#8806 { ["itemType"] = table#8807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2279382", }, ["subjectLabel"] = table#8809 { ["type"] = "literal", ["value"] = "The reliability of lexicographic product digraphs", ["xml:lang"] = "en", }, }, table#8810 { ["itemType"] = table#8811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2279623", }, ["subjectLabel"] = table#8813 { ["type"] = "literal", ["value"] = "The \$(d, 1)\$-total labelling of Sierpiński-like graphs", ["xml:lang"] = "en", }, }, table#8814 { ["itemType"] = table#8815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2279635", }, ["subjectLabel"] = table#8817 { ["type"] = "literal", ["value"] = "Discrete advection-diffusion equations on graphs: maximum principle and finite volumes", ["xml:lang"] = "en", }, }, table#8818 { ["itemType"] = table#8819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2279643", }, ["subjectLabel"] = table#8821 { ["type"] = "literal", ["value"] = "A polynomial algorithm for computing the weak rupture degree of trees", ["xml:lang"] = "en", }, }, table#8822 { ["itemType"] = table#8823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2279763", }, ["subjectLabel"] = table#8825 { ["type"] = "literal", ["value"] = "Orderings of a class of trees with respect to the Merrifield-Simmons index and the Hosoya index", ["xml:lang"] = "en", }, }, table#8826 { ["itemType"] = table#8827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2281214", }, ["subjectLabel"] = table#8829 { ["type"] = "literal", ["value"] = "Sequential decision model for inference and prediction on nonuniform hypergraphs with application to knot matching from computational forestry", ["xml:lang"] = "en", }, }, table#8830 { ["itemType"] = table#8831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2282473", }, ["subjectLabel"] = table#8833 { ["type"] = "literal", ["value"] = "Deficiency and forbidden subgraphs of connected, locally-connected graphs", ["xml:lang"] = "en", }, }, table#8834 { ["itemType"] = table#8835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2282476", }, ["subjectLabel"] = table#8837 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles", ["xml:lang"] = "en", }, }, table#8838 { ["itemType"] = table#8839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2282486", }, ["subjectLabel"] = table#8841 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total choosability of IC-planar graphs", ["xml:lang"] = "en", }, }, table#8842 { ["itemType"] = table#8843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2282792", }, ["subjectLabel"] = table#8845 { ["type"] = "literal", ["value"] = "On the least eigenvalue of \$A_\\alpha \$-matrix of graphs", ["xml:lang"] = "en", }, }, table#8846 { ["itemType"] = table#8847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2283166", }, ["subjectLabel"] = table#8849 { ["type"] = "literal", ["value"] = "Valency-based topological descriptors and structural property of the generalized Sierpiński networks", ["xml:lang"] = "en", }, }, table#8850 { ["itemType"] = table#8851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2283734", }, ["subjectLabel"] = table#8853 { ["type"] = "literal", ["value"] = "\$J\$-coloring of graph operations", ["xml:lang"] = "en", }, }, table#8854 { ["itemType"] = table#8855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2284049", }, ["subjectLabel"] = table#8857 { ["type"] = "literal", ["value"] = "Characterization of \$k\$-subconnected graphs", ["xml:lang"] = "en", }, }, table#8858 { ["itemType"] = table#8859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2284748", }, ["subjectLabel"] = table#8861 { ["type"] = "literal", ["value"] = "Factorizing regular graphs", ["xml:lang"] = "en", }, }, table#8862 { ["itemType"] = table#8863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2284787", }, ["subjectLabel"] = table#8865 { ["type"] = "literal", ["value"] = "Choosability with separation of planar graphs without prescribed cycles", ["xml:lang"] = "en", }, }, table#8866 { ["itemType"] = table#8867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2286097", }, ["subjectLabel"] = table#8869 { ["type"] = "literal", ["value"] = "Anti-\$k\$-labeling of graphs", ["xml:lang"] = "en", }, }, table#8870 { ["itemType"] = table#8871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2286100", }, ["subjectLabel"] = table#8873 { ["type"] = "literal", ["value"] = "The list linear arboricity of planar graphs with 7-cycles containing at most two chords", ["xml:lang"] = "en", }, }, table#8874 { ["itemType"] = table#8875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2286125", }, ["subjectLabel"] = table#8877 { ["type"] = "literal", ["value"] = "Domination number of incidence graphs of block designs", ["xml:lang"] = "en", }, }, table#8878 { ["itemType"] = table#8879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2287476", }, ["subjectLabel"] = table#8881 { ["type"] = "literal", ["value"] = "Layered graphs: applications and algorithms", ["xml:lang"] = "en", }, }, table#8882 { ["itemType"] = table#8883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2287757", }, ["subjectLabel"] = table#8885 { ["type"] = "literal", ["value"] = "Cospectral bipartite graphs with the same degree sequences but with different number of large cycles", ["xml:lang"] = "en", }, }, table#8886 { ["itemType"] = table#8887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2287760", }, ["subjectLabel"] = table#8889 { ["type"] = "literal", ["value"] = "Hamiltonian cycles in normal Cayley graphs", ["xml:lang"] = "en", }, }, table#8890 { ["itemType"] = table#8891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2287776", }, ["subjectLabel"] = table#8893 { ["type"] = "literal", ["value"] = "Comparison and extremal results on three eccentricity-based invariants of graphs", ["xml:lang"] = "en", }, }, table#8894 { ["itemType"] = table#8895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2288682", }, ["subjectLabel"] = table#8897 { ["type"] = "literal", ["value"] = "Synchronization of complex-valued dynamic networks with intermittently adaptive coupling: a direct error method", ["xml:lang"] = "en", }, }, table#8898 { ["itemType"] = table#8899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2292128", }, ["subjectLabel"] = table#8901 { ["type"] = "literal", ["value"] = "Neighbor product distinguishing total colorings of 2-degenerate graphs", ["xml:lang"] = "en", }, }, table#8902 { ["itemType"] = table#8903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2292143", }, ["subjectLabel"] = table#8905 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13", ["xml:lang"] = "en", }, }, table#8906 { ["itemType"] = table#8907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2293202", }, ["subjectLabel"] = table#8909 { ["type"] = "literal", ["value"] = "Managing consensus based on leadership in opinion dynamics", ["xml:lang"] = "en", }, }, table#8910 { ["itemType"] = table#8911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2293835", }, ["subjectLabel"] = table#8913 { ["type"] = "literal", ["value"] = "Zeroth-order general Randić index of cactus graphs", ["xml:lang"] = "en", }, }, table#8914 { ["itemType"] = table#8915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2293840", }, ["subjectLabel"] = table#8917 { ["type"] = "literal", ["value"] = "Effect of vertex deletion on the weak Roman domination number of a graph", ["xml:lang"] = "en", }, }, table#8918 { ["itemType"] = table#8919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2297715", }, ["subjectLabel"] = table#8921 { ["type"] = "literal", ["value"] = "Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3", ["xml:lang"] = "en", }, }, table#8922 { ["itemType"] = table#8923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2297720", }, ["subjectLabel"] = table#8925 { ["type"] = "literal", ["value"] = "Two results about the Turán number of star forests", ["xml:lang"] = "en", }, }, table#8926 { ["itemType"] = table#8927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2298039", }, ["subjectLabel"] = table#8929 { ["type"] = "literal", ["value"] = "Spanning trees with at most 6 leaves in \$K_{1,5}\$-free graphs", ["xml:lang"] = "en", }, }, table#8930 { ["itemType"] = table#8931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2302022", }, ["subjectLabel"] = table#8933 { ["type"] = "literal", ["value"] = "Spanning \$k\$-ended trees in quasi-claw-free graphs", ["xml:lang"] = "en", }, }, table#8934 { ["itemType"] = table#8935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2302885", }, ["subjectLabel"] = table#8937 { ["type"] = "literal", ["value"] = "Inertias of Laplacian matrices of weighted signed graphs", ["xml:lang"] = "en", }, }, table#8938 { ["itemType"] = table#8939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2303654", }, ["subjectLabel"] = table#8941 { ["type"] = "literal", ["value"] = "A discrete districting plan", ["xml:lang"] = "en", }, }, table#8942 { ["itemType"] = table#8943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2305929", }, ["subjectLabel"] = table#8945 { ["type"] = "literal", ["value"] = "A classification of cubic connected bi-dicirculants", ["xml:lang"] = "en", }, }, table#8946 { ["itemType"] = table#8947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2309219", }, ["subjectLabel"] = table#8949 { ["type"] = "literal", ["value"] = "Group connectivity and group coloring: small groups versus large groups", ["xml:lang"] = "en", }, }, table#8950 { ["itemType"] = table#8951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2312661", }, ["subjectLabel"] = table#8953 { ["type"] = "literal", ["value"] = "Modular decomposition of graphs and the distance preserving property", ["xml:lang"] = "en", }, }, table#8954 { ["itemType"] = table#8955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2314137", }, ["subjectLabel"] = table#8957 { ["type"] = "literal", ["value"] = "Wiener index, hyper-Wiener index, Harary index and Hamiltonicity properties of graphs", ["xml:lang"] = "en", }, }, table#8958 { ["itemType"] = table#8959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2316309", }, ["subjectLabel"] = table#8961 { ["type"] = "literal", ["value"] = "On traceability of claw-\${o_{-1}}\$-heavy graphs", ["xml:lang"] = "en", }, }, table#8962 { ["itemType"] = table#8963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2317868", }, ["subjectLabel"] = table#8965 { ["type"] = "literal", ["value"] = "The \$h\$-extra connectivity of \$k\$-ary \$n\$-cubes", ["xml:lang"] = "en", }, }, table#8966 { ["itemType"] = table#8967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2317940", }, ["subjectLabel"] = table#8969 { ["type"] = "literal", ["value"] = "The embedding of annihilating-ideal graphs associated to lattices in the projective plane", ["xml:lang"] = "en", }, }, table#8970 { ["itemType"] = table#8971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2318192", }, ["subjectLabel"] = table#8973 { ["type"] = "literal", ["value"] = "Supereulerian digraphs with given diameter", ["xml:lang"] = "en", }, }, table#8974 { ["itemType"] = table#8975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2319708", }, ["subjectLabel"] = table#8977 { ["type"] = "literal", ["value"] = "Unipancyclic matroids", ["xml:lang"] = "en", }, }, table#8978 { ["itemType"] = table#8979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2319723", }, ["subjectLabel"] = table#8981 { ["type"] = "literal", ["value"] = "A note on the smallest connected non-traceable cubic bipartite planar graph", ["xml:lang"] = "en", }, }, table#8982 { ["itemType"] = table#8983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2320125", }, ["subjectLabel"] = table#8985 { ["type"] = "literal", ["value"] = "On atom-bond connectivity index of graphs", ["xml:lang"] = "en", }, }, table#8986 { ["itemType"] = table#8987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2320667", }, ["subjectLabel"] = table#8989 { ["type"] = "literal", ["value"] = "Topological properties of a 3-regular small world network", ["xml:lang"] = "en", }, }, table#8990 { ["itemType"] = table#8991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2321673", }, ["subjectLabel"] = table#8993 { ["type"] = "literal", ["value"] = "Vulnerability of super connected split graphs and bisplit graphs", ["xml:lang"] = "en", }, }, table#8994 { ["itemType"] = table#8995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2323474", }, ["subjectLabel"] = table#8997 { ["type"] = "literal", ["value"] = "Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index", ["xml:lang"] = "en", }, }, table#8998 { ["itemType"] = table#8999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2324488", }, ["subjectLabel"] = table#9001 { ["type"] = "literal", ["value"] = "On the minimum leaf number of cubic graphs", ["xml:lang"] = "en", }, }, table#9002 { ["itemType"] = table#9003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2324489", }, ["subjectLabel"] = table#9005 { ["type"] = "literal", ["value"] = "On \$s\$-Hamiltonian line graphs of claw-free graphs", ["xml:lang"] = "en", }, }, table#9006 { ["itemType"] = table#9007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2324494", }, ["subjectLabel"] = table#9009 { ["type"] = "literal", ["value"] = "A constructive characterization of contraction critical 8-connected graphs with minimum degree 9", ["xml:lang"] = "en", }, }, table#9010 { ["itemType"] = table#9011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2325123", }, ["subjectLabel"] = table#9013 { ["type"] = "literal", ["value"] = "Solutions to all-colors problem on graph cellular automata", ["xml:lang"] = "en", }, }, table#9014 { ["itemType"] = table#9015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2325144", }, ["subjectLabel"] = table#9017 { ["type"] = "literal", ["value"] = "Computing the weighted isolated scattering number of interval graphs in polynomial time", ["xml:lang"] = "en", }, }, table#9018 { ["itemType"] = table#9019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2326167", }, ["subjectLabel"] = table#9021 { ["type"] = "literal", ["value"] = "Minimum covering reciprocal distance signless Laplacian energy of graphs", ["xml:lang"] = "en", }, }, table#9022 { ["itemType"] = table#9023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2326334", }, ["subjectLabel"] = table#9025 { ["type"] = "literal", ["value"] = "The poset of graphs ordered by induced containment", ["xml:lang"] = "en", }, }, table#9026 { ["itemType"] = table#9027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2328110", }, ["subjectLabel"] = table#9029 { ["type"] = "literal", ["value"] = "The number of P-vertices for acyclic matrices of maximum nullity", ["xml:lang"] = "en", }, }, table#9030 { ["itemType"] = table#9031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2328350", }, ["subjectLabel"] = table#9033 { ["type"] = "literal", ["value"] = "Wave propagation in fractal trees. Mathematical and numerical issues", ["xml:lang"] = "en", }, }, table#9034 { ["itemType"] = table#9035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2330105", }, ["subjectLabel"] = table#9037 { ["type"] = "literal", ["value"] = "Power domination throttling", ["xml:lang"] = "en", }, }, table#9038 { ["itemType"] = table#9039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2330133", }, ["subjectLabel"] = table#9041 { ["type"] = "literal", ["value"] = "The \$h\$-edge tolerable diagnosability of balanced hypercubes", ["xml:lang"] = "en", }, }, table#9042 { ["itemType"] = table#9043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333163", }, ["subjectLabel"] = table#9045 { ["type"] = "literal", ["value"] = "The \$k\$-path vertex cover in Cartesian product graphs and complete bipartite graphs", ["xml:lang"] = "en", }, }, table#9046 { ["itemType"] = table#9047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333221", }, ["subjectLabel"] = table#9049 { ["type"] = "literal", ["value"] = "The total bondage numbers and efficient total dominations of vertex-transitive graphs", ["xml:lang"] = "en", }, }, table#9050 { ["itemType"] = table#9051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333237", }, ["subjectLabel"] = table#9053 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total chromatic number of planar graphs", ["xml:lang"] = "en", }, }, table#9054 { ["itemType"] = table#9055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333242", }, ["subjectLabel"] = table#9057 { ["type"] = "literal", ["value"] = "Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index", ["xml:lang"] = "en", }, }, table#9058 { ["itemType"] = table#9059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333465", }, ["subjectLabel"] = table#9061 { ["type"] = "literal", ["value"] = "Analytical treatment of higher-order graphs: a path ordinal method for solving graphs", ["xml:lang"] = "en", }, }, table#9062 { ["itemType"] = table#9063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333614", }, ["subjectLabel"] = table#9065 { ["type"] = "literal", ["value"] = "Dynamics on binary relations over topological spaces", ["xml:lang"] = "en", }, }, table#9066 { ["itemType"] = table#9067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2333811", }, ["subjectLabel"] = table#9069 { ["type"] = "literal", ["value"] = "Strongly Menger connectedness of data center network and \$(n,k)\$-star graph", ["xml:lang"] = "en", }, }, table#9070 { ["itemType"] = table#9071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2334051", }, ["subjectLabel"] = table#9073 { ["type"] = "literal", ["value"] = "Extremal \$k\$-generalized quasi unicyclic graphs with respect to first and second Zagreb indices", ["xml:lang"] = "en", }, }, table#9074 { ["itemType"] = table#9075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2334073", }, ["subjectLabel"] = table#9077 { ["type"] = "literal", ["value"] = "The local structure of claw-free graphs without induced generalized bulls", ["xml:lang"] = "en", }, }, table#9078 { ["itemType"] = table#9079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2334082", }, ["subjectLabel"] = table#9081 { ["type"] = "literal", ["value"] = "Some conditions for the existence of Euler \$H\$-trails", ["xml:lang"] = "en", }, }, table#9082 { ["itemType"] = table#9083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335535", }, ["subjectLabel"] = table#9085 { ["type"] = "literal", ["value"] = "The \$1,2\$-good-neighbor conditional diagnosabilities of regular graphs", ["xml:lang"] = "en", }, }, table#9086 { ["itemType"] = table#9087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335545", }, ["subjectLabel"] = table#9089 { ["type"] = "literal", ["value"] = "Fault tolerance of locally twisted cubes", ["xml:lang"] = "en", }, }, table#9090 { ["itemType"] = table#9091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335565", }, ["subjectLabel"] = table#9093 { ["type"] = "literal", ["value"] = "Augmented Zagreb index of trees and unicyclic graphs with perfect matchings", ["xml:lang"] = "en", }, }, table#9094 { ["itemType"] = table#9095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335590", }, ["subjectLabel"] = table#9097 { ["type"] = "literal", ["value"] = "The \$g\$-extra connectivity and diagnosability of crossed cubes", ["xml:lang"] = "en", }, }, table#9098 { ["itemType"] = table#9099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335595", }, ["subjectLabel"] = table#9101 { ["type"] = "literal", ["value"] = "On the edge-Szeged index of unicyclic graphs with given diameter", ["xml:lang"] = "en", }, }, table#9102 { ["itemType"] = table#9103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335674", }, ["subjectLabel"] = table#9105 { ["type"] = "literal", ["value"] = "Relations between total irregularity and non-self-centrality of graphs", ["xml:lang"] = "en", }, }, table#9106 { ["itemType"] = table#9107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2335676", }, ["subjectLabel"] = table#9109 { ["type"] = "literal", ["value"] = "An extremal problem on graphic sequences with a realization containing every \$\\ell \$-tree on \$k\$ vertices", ["xml:lang"] = "en", }, }, table#9110 { ["itemType"] = table#9111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2336558", }, ["subjectLabel"] = table#9113 { ["type"] = "literal", ["value"] = "Weighted cache location problem with identical servers", ["xml:lang"] = "en", }, }, table#9114 { ["itemType"] = table#9115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2336708", }, ["subjectLabel"] = table#9117 { ["type"] = "literal", ["value"] = "The maximal total irregularity of bicyclic graphs", ["xml:lang"] = "en", }, }, table#9118 { ["itemType"] = table#9119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2337244", }, ["subjectLabel"] = table#9121 { ["type"] = "literal", ["value"] = "Resistance distance in \$H\$-join of graphs \$G_1,G_2,\\dots,G_k\$", ["xml:lang"] = "en", }, }, table#9122 { ["itemType"] = table#9123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2337997", }, ["subjectLabel"] = table#9125 { ["type"] = "literal", ["value"] = "Extremal bipartite graphs with given parameters on the resistance-Harary index", ["xml:lang"] = "en", }, }, table#9126 { ["itemType"] = table#9127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2340805", }, ["subjectLabel"] = table#9129 { ["type"] = "literal", ["value"] = "Total coloring of planar graphs without some chordal 6-cycles", ["xml:lang"] = "en", }, }, table#9130 { ["itemType"] = table#9131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2341063", }, ["subjectLabel"] = table#9133 { ["type"] = "literal", ["value"] = "Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs", ["xml:lang"] = "en", }, }, table#9134 { ["itemType"] = table#9135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2343993", }, ["subjectLabel"] = table#9137 { ["type"] = "literal", ["value"] = "The \$r\$-acyclic chromatic number of planar graphs", ["xml:lang"] = "en", }, }, table#9138 { ["itemType"] = table#9139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2345540", }, ["subjectLabel"] = table#9141 { ["type"] = "literal", ["value"] = "On the total-neighbor-distinguishing index by sums", ["xml:lang"] = "en", }, }, table#9142 { ["itemType"] = table#9143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2351013", }, ["subjectLabel"] = table#9145 { ["type"] = "literal", ["value"] = "Four-connected triangulations of planar point sets", ["xml:lang"] = "en", }, }, table#9146 { ["itemType"] = table#9147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2352360", }, ["subjectLabel"] = table#9149 { ["type"] = "literal", ["value"] = "On total colorings of 1-planar graphs", ["xml:lang"] = "en", }, }, table#9150 { ["itemType"] = table#9151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2354605", }, ["subjectLabel"] = table#9153 { ["type"] = "literal", ["value"] = "Intersections of cycles in \$k\$-connected graphs", ["xml:lang"] = "en", }, }, table#9154 { ["itemType"] = table#9155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2354611", }, ["subjectLabel"] = table#9157 { ["type"] = "literal", ["value"] = "Group connectivity and matchings", ["xml:lang"] = "en", }, }, table#9158 { ["itemType"] = table#9159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2354617", }, ["subjectLabel"] = table#9161 { ["type"] = "literal", ["value"] = "Group connectivity in \$J_3\$ line graphs", ["xml:lang"] = "en", }, }, table#9162 { ["itemType"] = table#9163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2355461", }, ["subjectLabel"] = table#9165 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings of triangle free planar graphs", ["xml:lang"] = "en", }, }, table#9166 { ["itemType"] = table#9167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2355649", }, ["subjectLabel"] = table#9169 { ["type"] = "literal", ["value"] = "Zagreb indices of graphs", ["xml:lang"] = "en", }, }, table#9170 { ["itemType"] = table#9171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2356189", }, ["subjectLabel"] = table#9173 { ["type"] = "literal", ["value"] = "Static search games played over graphs and general metric spaces", ["xml:lang"] = "en", }, }, table#9174 { ["itemType"] = table#9175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2357140", }, ["subjectLabel"] = table#9177 { ["type"] = "literal", ["value"] = "The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters", ["xml:lang"] = "en", }, }, table#9178 { ["itemType"] = table#9179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366213", }, ["subjectLabel"] = table#9181 { ["type"] = "literal", ["value"] = "Long paths and cycles in tough graphs", ["xml:lang"] = "en", }, }, table#9182 { ["itemType"] = table#9183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366610", }, ["subjectLabel"] = table#9185 { ["type"] = "literal", ["value"] = "The partition problem", ["xml:lang"] = "en", }, }, table#9186 { ["itemType"] = table#9187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366954", }, ["subjectLabel"] = table#9189 { ["type"] = "literal", ["value"] = "On the average genus of a graph", ["xml:lang"] = "en", }, }, table#9190 { ["itemType"] = table#9191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366959", }, ["subjectLabel"] = table#9193 { ["type"] = "literal", ["value"] = "On the maximum number of distinct factors of a binary string", ["xml:lang"] = "en", }, }, table#9194 { ["itemType"] = table#9195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2369881", }, ["subjectLabel"] = table#9197 { ["type"] = "literal", ["value"] = "Data migration on parallel disks: Algorithms and evaluation", ["xml:lang"] = "en", }, }, table#9198 { ["itemType"] = table#9199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2372576", }, ["subjectLabel"] = table#9201 { ["type"] = "literal", ["value"] = "On total chromatic number of planar graphs without 4-cycles", ["xml:lang"] = "en", }, }, table#9202 { ["itemType"] = table#9203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2373931", }, ["subjectLabel"] = table#9205 { ["type"] = "literal", ["value"] = "Bichromatic quadrangulations with Steiner points", ["xml:lang"] = "en", }, }, table#9206 { ["itemType"] = table#9207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2375912", }, ["subjectLabel"] = table#9209 { ["type"] = "literal", ["value"] = "\$C_{4p}\$-frame of complete multipartite multigraphs", ["xml:lang"] = "en", }, }, table#9210 { ["itemType"] = table#9211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2376081", }, ["subjectLabel"] = table#9213 { ["type"] = "literal", ["value"] = "Degree distance of unicyclic graphs with given matching number", ["xml:lang"] = "en", }, }, table#9214 { ["itemType"] = table#9215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2376088", }, ["subjectLabel"] = table#9217 { ["type"] = "literal", ["value"] = "Tank-ring factors in supereulerian claw-free graphs", ["xml:lang"] = "en", }, }, table#9218 { ["itemType"] = table#9219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2376106", }, ["subjectLabel"] = table#9221 { ["type"] = "literal", ["value"] = "Multidecompositions of several graph products", ["xml:lang"] = "en", }, }, table#9222 { ["itemType"] = table#9223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2376109", }, ["subjectLabel"] = table#9225 { ["type"] = "literal", ["value"] = "The linear arboricity of planar graphs without 5-, 6-cycles with chords", ["xml:lang"] = "en", }, }, table#9226 { ["itemType"] = table#9227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2385136", }, ["subjectLabel"] = table#9229 { ["type"] = "literal", ["value"] = "Cycles in circuit graphs of matroids", ["xml:lang"] = "en", }, }, table#9230 { ["itemType"] = table#9231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2385137", }, ["subjectLabel"] = table#9233 { ["type"] = "literal", ["value"] = "Relative length of longest paths and cycles in graphs", ["xml:lang"] = "en", }, }, table#9234 { ["itemType"] = table#9235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2385374", }, ["subjectLabel"] = table#9237 { ["type"] = "literal", ["value"] = "Estimate the distance of genome rearrangements by reversals", ["xml:lang"] = "en", }, }, table#9238 { ["itemType"] = table#9239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2388596", }, ["subjectLabel"] = table#9241 { ["type"] = "literal", ["value"] = "Rational quadratic approximation to real algebraic curves", ["xml:lang"] = "en", }, }, table#9242 { ["itemType"] = table#9243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2392025", }, ["subjectLabel"] = table#9245 { ["type"] = "literal", ["value"] = "Planar zero divisor graphs of partially ordered sets", ["xml:lang"] = "en", }, }, table#9246 { ["itemType"] = table#9247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2396735", }, ["subjectLabel"] = table#9249 { ["type"] = "literal", ["value"] = "On a novel eccentricity-based invariant of a graph", ["xml:lang"] = "en", }, }, table#9250 { ["itemType"] = table#9251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2399620", }, ["subjectLabel"] = table#9253 { ["type"] = "literal", ["value"] = "Applying clique-decomposition for computing Gromov hyperbolicity", ["xml:lang"] = "en", }, }, table#9254 { ["itemType"] = table#9255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2400127", }, ["subjectLabel"] = table#9257 { ["type"] = "literal", ["value"] = "On the generalization of Cayley graphs of commutative rings", ["xml:lang"] = "en", }, }, table#9258 { ["itemType"] = table#9259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2401770", }, ["subjectLabel"] = table#9261 { ["type"] = "literal", ["value"] = "On total colorings of some special 1-planar graphs", ["xml:lang"] = "en", }, }, table#9262 { ["itemType"] = table#9263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2402272", }, ["subjectLabel"] = table#9265 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total coloring of planar graphs without 5-cycles", ["xml:lang"] = "en", }, }, table#9266 { ["itemType"] = table#9267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2402945", }, ["subjectLabel"] = table#9269 { ["type"] = "literal", ["value"] = "Combinatorial analysis of a subtraction game on graphs", ["xml:lang"] = "en", }, }, table#9270 { ["itemType"] = table#9271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2404100", }, ["subjectLabel"] = table#9273 { ["type"] = "literal", ["value"] = "Solution to an extremal problem on bigraphic pairs with a \$Z_3\$-connected realization", ["xml:lang"] = "en", }, }, table#9274 { ["itemType"] = table#9275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2404404", }, ["subjectLabel"] = table#9277 { ["type"] = "literal", ["value"] = "Degree and neighborhood conditions for Hamiltonicity of claw-free graphs", ["xml:lang"] = "en", }, }, table#9278 { ["itemType"] = table#9279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2405976", }, ["subjectLabel"] = table#9281 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total chromatic number of \$K_4\$-minor free graph", ["xml:lang"] = "en", }, }, table#9282 { ["itemType"] = table#9283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2406507", }, ["subjectLabel"] = table#9285 { ["type"] = "literal", ["value"] = "Existence of solution to a model for gas transportation networks on non-flat topography", ["xml:lang"] = "en", }, }, table#9286 { ["itemType"] = table#9287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2408980", }, ["subjectLabel"] = table#9289 { ["type"] = "literal", ["value"] = "Stars versus stripes Ramsey numbers", ["xml:lang"] = "en", }, }, table#9290 { ["itemType"] = table#9291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2409525", }, ["subjectLabel"] = table#9293 { ["type"] = "literal", ["value"] = "Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz", ["xml:lang"] = "en", }, }, table#9294 { ["itemType"] = table#9295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2409530", }, ["subjectLabel"] = table#9297 { ["type"] = "literal", ["value"] = "Partial degree conditions and cycle coverings in bipartite graphs", ["xml:lang"] = "en", }, }, table#9298 { ["itemType"] = table#9299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2409535", }, ["subjectLabel"] = table#9301 { ["type"] = "literal", ["value"] = "3-rainbow index and forbidden subgraphs", ["xml:lang"] = "en", }, }, table#9302 { ["itemType"] = table#9303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2409792", }, ["subjectLabel"] = table#9305 { ["type"] = "literal", ["value"] = "Labeled embedding of \$(n, n-2)\$-graphs in their complements", ["xml:lang"] = "en", }, }, table#9306 { ["itemType"] = table#9307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2410046", }, ["subjectLabel"] = table#9309 { ["type"] = "literal", ["value"] = "Total coloring of planar graphs without adjacent chordal 6-cycles", ["xml:lang"] = "en", }, }, table#9310 { ["itemType"] = table#9311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2410091", }, ["subjectLabel"] = table#9313 { ["type"] = "literal", ["value"] = "The adjacent vertex distinguishing total chromatic numbers of planar graphs with \$\\Delta=10\$", ["xml:lang"] = "en", }, }, table#9314 { ["itemType"] = table#9315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2410093", }, ["subjectLabel"] = table#9317 { ["type"] = "literal", ["value"] = "On the vertex cover \$P_3\$ problem parameterized by treewidth", ["xml:lang"] = "en", }, }, table#9318 { ["itemType"] = table#9319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2410106", }, ["subjectLabel"] = table#9321 { ["type"] = "literal", ["value"] = "On maximum Wiener index of trees and graphs with given radius", ["xml:lang"] = "en", }, }, table#9322 { ["itemType"] = table#9323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2410242", }, ["subjectLabel"] = table#9325 { ["type"] = "literal", ["value"] = "On the size of graphs without repeated cycle lengths", ["xml:lang"] = "en", }, }, table#9326 { ["itemType"] = table#9327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2410579", }, ["subjectLabel"] = table#9329 { ["type"] = "literal", ["value"] = "An implicit degree sum condition for cycles through specified vertices", ["xml:lang"] = "en", }, }, table#9330 { ["itemType"] = table#9331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2411593", }, ["subjectLabel"] = table#9333 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flow of graphs with small independence number", ["xml:lang"] = "en", }, }, table#9334 { ["itemType"] = table#9335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2411597", }, ["subjectLabel"] = table#9337 { ["type"] = "literal", ["value"] = "On the determinant of the Laplacian matrix of a complex unit gain graph", ["xml:lang"] = "en", }, }, table#9338 { ["itemType"] = table#9339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2412940", }, ["subjectLabel"] = table#9341 { ["type"] = "literal", ["value"] = "Direct decomposition theory of torsion-free abelian groups of finite rank: graph method", ["xml:lang"] = "en", }, }, table#9342 { ["itemType"] = table#9343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2413624", }, ["subjectLabel"] = table#9345 { ["type"] = "literal", ["value"] = "On the independence number of Cayley digraphs of rectangular groups", ["xml:lang"] = "en", }, }, table#9346 { ["itemType"] = table#9347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2414123", }, ["subjectLabel"] = table#9349 { ["type"] = "literal", ["value"] = "An efficient case for computing minimum linear arboricity with small maximum degree", ["xml:lang"] = "en", }, }, table#9350 { ["itemType"] = table#9351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2420655", }, ["subjectLabel"] = table#9353 { ["type"] = "literal", ["value"] = "Deadlock resolution in wait-for graphs by vertex/arc deletion", ["xml:lang"] = "en", }, }, table#9354 { ["itemType"] = table#9355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2420662", }, ["subjectLabel"] = table#9357 { ["type"] = "literal", ["value"] = "Independent bondage number of a graph", ["xml:lang"] = "en", }, }, table#9358 { ["itemType"] = table#9359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2421385", }, ["subjectLabel"] = table#9361 { ["type"] = "literal", ["value"] = "On tight bounds for the \$k\$-forcing number of a graph", ["xml:lang"] = "en", }, }, table#9362 { ["itemType"] = table#9363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2421417", }, ["subjectLabel"] = table#9365 { ["type"] = "literal", ["value"] = "The total eccentricity sum of non-adjacent vertex pairs in graphs", ["xml:lang"] = "en", }, }, table#9366 { ["itemType"] = table#9367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2421421", }, ["subjectLabel"] = table#9369 { ["type"] = "literal", ["value"] = "The regular digraph associated to a poset", ["xml:lang"] = "en", }, }, table#9370 { ["itemType"] = table#9371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2422651", }, ["subjectLabel"] = table#9373 { ["type"] = "literal", ["value"] = "Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs", ["xml:lang"] = "en", }, }, table#9374 { ["itemType"] = table#9375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2422741", }, ["subjectLabel"] = table#9377 { ["type"] = "literal", ["value"] = "A polynomial algorithm for weighted scattering number in interval graphs", ["xml:lang"] = "en", }, }, table#9378 { ["itemType"] = table#9379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2423101", }, ["subjectLabel"] = table#9381 { ["type"] = "literal", ["value"] = "Local antimagic labeling of graphs", ["xml:lang"] = "en", }, }, table#9382 { ["itemType"] = table#9383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2424662", }, ["subjectLabel"] = table#9385 { ["type"] = "literal", ["value"] = "A polynomial algorithm determining cyclic vertex connectivity of \$k\$-regular graphs with fixed \$k\$", ["xml:lang"] = "en", }, }, table#9386 { ["itemType"] = table#9387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2424800", }, ["subjectLabel"] = table#9389 { ["type"] = "literal", ["value"] = "Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10", ["xml:lang"] = "en", }, }, table#9390 { ["itemType"] = table#9391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2424811", }, ["subjectLabel"] = table#9393 { ["type"] = "literal", ["value"] = "Connected power domination in graphs", ["xml:lang"] = "en", }, }, table#9394 { ["itemType"] = table#9395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2424827", }, ["subjectLabel"] = table#9397 { ["type"] = "literal", ["value"] = "The rank of a complex unit gain graph in terms of the rank of its underlying graph", ["xml:lang"] = "en", }, }, table#9398 { ["itemType"] = table#9399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2424828", }, ["subjectLabel"] = table#9401 { ["type"] = "literal", ["value"] = "A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs", ["xml:lang"] = "en", }, }, table#9402 { ["itemType"] = table#9403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2429330", }, ["subjectLabel"] = table#9405 { ["type"] = "literal", ["value"] = "Improved approximation algorithms for data migration", ["xml:lang"] = "en", }, }, table#9406 { ["itemType"] = table#9407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2430307", }, ["subjectLabel"] = table#9409 { ["type"] = "literal", ["value"] = "Group connectivity and group colorings of graphs --- a survey", ["xml:lang"] = "en", }, }, table#9410 { ["itemType"] = table#9411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2433725", }, ["subjectLabel"] = table#9413 { ["type"] = "literal", ["value"] = "Circumferences of regular claw-free graphs", ["xml:lang"] = "en", }, }, table#9414 { ["itemType"] = table#9415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2435425", }, ["subjectLabel"] = table#9417 { ["type"] = "literal", ["value"] = "Sharp upper bounds on the distance spectral radius of a graph", ["xml:lang"] = "en", }, }, table#9418 { ["itemType"] = table#9419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2436659", }, ["subjectLabel"] = table#9421 { ["type"] = "literal", ["value"] = "Minimum diameter cost-constrained Steiner trees", ["xml:lang"] = "en", }, }, table#9422 { ["itemType"] = table#9423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2437770", }, ["subjectLabel"] = table#9425 { ["type"] = "literal", ["value"] = "Total colorings of planar graphs with sparse triangles", ["xml:lang"] = "en", }, }, table#9426 { ["itemType"] = table#9427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2438328", }, ["subjectLabel"] = table#9429 { ["type"] = "literal", ["value"] = "Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs", ["xml:lang"] = "en", }, }, table#9430 { ["itemType"] = table#9431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2439122", }, ["subjectLabel"] = table#9433 { ["type"] = "literal", ["value"] = "Second kind maximum matching graph", ["xml:lang"] = "en", }, }, table#9434 { ["itemType"] = table#9435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2439257", }, ["subjectLabel"] = table#9437 { ["type"] = "literal", ["value"] = "Removable edges in a spanning tree of a \$k\$-connected graph", ["xml:lang"] = "en", }, }, table#9438 { ["itemType"] = table#9439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2440104", }, ["subjectLabel"] = table#9441 { ["type"] = "literal", ["value"] = "The packing coloring of distance graphs \$D(k,t)\$", ["xml:lang"] = "en", }, }, table#9442 { ["itemType"] = table#9443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2440121", }, ["subjectLabel"] = table#9445 { ["type"] = "literal", ["value"] = "Maximally edge-connected graphs and zeroth-order general Randić index for \$0<\\alpha <1\$", ["xml:lang"] = "en", }, }, table#9446 { ["itemType"] = table#9447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2440128", }, ["subjectLabel"] = table#9449 { ["type"] = "literal", ["value"] = "The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree", ["xml:lang"] = "en", }, }, table#9450 { ["itemType"] = table#9451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2441342", }, ["subjectLabel"] = table#9453 { ["type"] = "literal", ["value"] = "Extremal Zagreb indices of graphs with a given number of cut edges", ["xml:lang"] = "en", }, }, table#9454 { ["itemType"] = table#9455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2441610", }, ["subjectLabel"] = table#9457 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts", ["xml:lang"] = "en", }, }, table#9458 { ["itemType"] = table#9459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2441626", }, ["subjectLabel"] = table#9461 { ["type"] = "literal", ["value"] = "Graphs with small second largest Laplacian eigenvalue", ["xml:lang"] = "en", }, }, table#9462 { ["itemType"] = table#9463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2441628", }, ["subjectLabel"] = table#9465 { ["type"] = "literal", ["value"] = "Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers", ["xml:lang"] = "en", }, }, table#9466 { ["itemType"] = table#9467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2441651", }, ["subjectLabel"] = table#9469 { ["type"] = "literal", ["value"] = "Rainbow triangles in edge-colored graphs", ["xml:lang"] = "en", }, }, table#9470 { ["itemType"] = table#9471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2441662", }, ["subjectLabel"] = table#9473 { ["type"] = "literal", ["value"] = "Cubic bi-Cayley graphs over abelian groups", ["xml:lang"] = "en", }, }, table#9474 { ["itemType"] = table#9475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2443019", }, ["subjectLabel"] = table#9477 { ["type"] = "literal", ["value"] = "An efficient construction of one-to-many node-disjoint paths in folded hypercubes", ["xml:lang"] = "en", }, }, table#9478 { ["itemType"] = table#9479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2444141", }, ["subjectLabel"] = table#9481 { ["type"] = "literal", ["value"] = "Circular \$L(j,k)\$-labeling number of direct product of path and cycle", ["xml:lang"] = "en", }, }, table#9482 { ["itemType"] = table#9483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2444539", }, ["subjectLabel"] = table#9485 { ["type"] = "literal", ["value"] = "The relationship between the eccentric connectivity index and Zagreb indices", ["xml:lang"] = "en", }, }, table#9486 { ["itemType"] = table#9487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2444546", }, ["subjectLabel"] = table#9489 { ["type"] = "literal", ["value"] = "The distance spectral radius of digraphs", ["xml:lang"] = "en", }, }, table#9490 { ["itemType"] = table#9491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2444740", }, ["subjectLabel"] = table#9493 { ["type"] = "literal", ["value"] = "The vertex cover \$P_3\$ problem in cubic graphs", ["xml:lang"] = "en", }, }, table#9494 { ["itemType"] = table#9495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2445260", }, ["subjectLabel"] = table#9497 { ["type"] = "literal", ["value"] = "Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity", ["xml:lang"] = "en", }, }, table#9498 { ["itemType"] = table#9499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2446336", }, ["subjectLabel"] = table#9501 { ["type"] = "literal", ["value"] = "Hamiltonian claw-free graphs involving minimum degrees", ["xml:lang"] = "en", }, }, table#9502 { ["itemType"] = table#9503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2446343", }, ["subjectLabel"] = table#9505 { ["type"] = "literal", ["value"] = "Signless Laplacian eigenvalues and circumference of graphs", ["xml:lang"] = "en", }, }, table#9506 { ["itemType"] = table#9507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2446352", }, ["subjectLabel"] = table#9509 { ["type"] = "literal", ["value"] = "On \$4\$-\$\\gamma_t\$-critical graphs of diameter two", ["xml:lang"] = "en", }, }, table#9510 { ["itemType"] = table#9511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2446439", }, ["subjectLabel"] = table#9513 { ["type"] = "literal", ["value"] = "Paired many-to-many disjoint path covers of the hypercubes", ["xml:lang"] = "en", }, }, table#9514 { ["itemType"] = table#9515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2446463", }, ["subjectLabel"] = table#9517 { ["type"] = "literal", ["value"] = "Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph", ["xml:lang"] = "en", }, }, table#9518 { ["itemType"] = table#9519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2446904", }, ["subjectLabel"] = table#9521 { ["type"] = "literal", ["value"] = "Comment on ``Kirchhoff index in line, subdivision and total graphs of a regular graph''", ["xml:lang"] = "en", }, }, table#9522 { ["itemType"] = table#9523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2447530", }, ["subjectLabel"] = table#9525 { ["type"] = "literal", ["value"] = "On the metric dimension of HDN", ["xml:lang"] = "en", }, }, table#9526 { ["itemType"] = table#9527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2448856", }, ["subjectLabel"] = table#9529 { ["type"] = "literal", ["value"] = "On the linear arboricity of graphs embeddable in surfaces", ["xml:lang"] = "en", }, }, table#9530 { ["itemType"] = table#9531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2448964", }, ["subjectLabel"] = table#9533 { ["type"] = "literal", ["value"] = "Decomposing graphs into paths of fixed length", ["xml:lang"] = "en", }, }, table#9534 { ["itemType"] = table#9535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2449103", }, ["subjectLabel"] = table#9537 { ["type"] = "literal", ["value"] = "Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees", ["xml:lang"] = "en", }, }, table#9538 { ["itemType"] = table#9539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2449108", }, ["subjectLabel"] = table#9541 { ["type"] = "literal", ["value"] = "Proof of conjectures on remoteness and proximity in graphs", ["xml:lang"] = "en", }, }, table#9542 { ["itemType"] = table#9543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2449112", }, ["subjectLabel"] = table#9545 { ["type"] = "literal", ["value"] = "Total colorings of planar graphs without chordal 6-cycles", ["xml:lang"] = "en", }, }, table#9546 { ["itemType"] = table#9547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2449140", }, ["subjectLabel"] = table#9549 { ["type"] = "literal", ["value"] = "On Laplacian energy of graphs", ["xml:lang"] = "en", }, }, table#9550 { ["itemType"] = table#9551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2449144", }, ["subjectLabel"] = table#9553 { ["type"] = "literal", ["value"] = "A note on graphs contraction-critical with respect to independence number", ["xml:lang"] = "en", }, }, table#9554 { ["itemType"] = table#9555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2449179", }, ["subjectLabel"] = table#9557 { ["type"] = "literal", ["value"] = "The crossing number of the Cartesian product of paths with complete graphs", ["xml:lang"] = "en", }, }, table#9558 { ["itemType"] = table#9559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2451446", }, ["subjectLabel"] = table#9561 { ["type"] = "literal", ["value"] = "The spanning laceability on the faulty bipartite hypercube-like networks", ["xml:lang"] = "en", }, }, table#9562 { ["itemType"] = table#9563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2452384", }, ["subjectLabel"] = table#9565 { ["type"] = "literal", ["value"] = "Chromatic Gallai identities operating on Lovász number", ["xml:lang"] = "en", }, }, table#9566 { ["itemType"] = table#9567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2452402", }, ["subjectLabel"] = table#9569 { ["type"] = "literal", ["value"] = "On graphs with cut vertices and cut edges", ["xml:lang"] = "en", }, }, table#9570 { ["itemType"] = table#9571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2452406", }, ["subjectLabel"] = table#9573 { ["type"] = "literal", ["value"] = "\$f\$-class two graphs whose \$f\$-cores have maximum degree two", ["xml:lang"] = "en", }, }, table#9574 { ["itemType"] = table#9575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2452418", }, ["subjectLabel"] = table#9577 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree", ["xml:lang"] = "en", }, }, table#9578 { ["itemType"] = table#9579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2628283", }, ["subjectLabel"] = table#9581 { ["type"] = "literal", ["value"] = "Strong Menger connectivity with conditional faults of folded hypercubes", ["xml:lang"] = "en", }, }, table#9582 { ["itemType"] = table#9583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2629242", }, ["subjectLabel"] = table#9585 { ["type"] = "literal", ["value"] = "A note on the neighbor sum distinguishing total coloring of planar graphs", ["xml:lang"] = "en", }, }, table#9586 { ["itemType"] = table#9587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2630334", }, ["subjectLabel"] = table#9589 { ["type"] = "literal", ["value"] = "Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs", ["xml:lang"] = "en", }, }, table#9590 { ["itemType"] = table#9591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2631075", }, ["subjectLabel"] = table#9593 { ["type"] = "literal", ["value"] = "Hamilton cycles in implicit 2-heavy graphs", ["xml:lang"] = "en", }, }, table#9594 { ["itemType"] = table#9595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2631091", }, ["subjectLabel"] = table#9597 { ["type"] = "literal", ["value"] = "Walk-powers and homomorphism bounds of planar signed graphs", ["xml:lang"] = "en", }, }, table#9598 { ["itemType"] = table#9599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2631096", }, ["subjectLabel"] = table#9601 { ["type"] = "literal", ["value"] = "3-factor-criticality in double domination edge critical graphs", ["xml:lang"] = "en", }, }, table#9602 { ["itemType"] = table#9603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2637150", }, ["subjectLabel"] = table#9605 { ["type"] = "literal", ["value"] = "On the distance spectrum of graphs", ["xml:lang"] = "en", }, }, table#9606 { ["itemType"] = table#9607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2637155", }, ["subjectLabel"] = table#9609 { ["type"] = "literal", ["value"] = "A survey on bases of sign pattern matrices", ["xml:lang"] = "en", }, }, table#9610 { ["itemType"] = table#9611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2637734", }, ["subjectLabel"] = table#9613 { ["type"] = "literal", ["value"] = "Neighborhood unions and \$Z_3\$-connectivity in graphs", ["xml:lang"] = "en", }, }, table#9614 { ["itemType"] = table#9615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2637735", }, ["subjectLabel"] = table#9617 { ["type"] = "literal", ["value"] = "Nowhere-zero 3-flows of graphs with independence number two", ["xml:lang"] = "en", }, }, table#9618 { ["itemType"] = table#9619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2637742", }, ["subjectLabel"] = table#9621 { ["type"] = "literal", ["value"] = "On edge cut of graphs leaving components of order at least five", ["xml:lang"] = "en", }, }, table#9622 { ["itemType"] = table#9623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2637743", }, ["subjectLabel"] = table#9625 { ["type"] = "literal", ["value"] = "Two equivalent properties of \$\\mathcal Z_3\$-connectivity", ["xml:lang"] = "en", }, }, table#9626 { ["itemType"] = table#9627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2643812", }, ["subjectLabel"] = table#9629 { ["type"] = "literal", ["value"] = "The robust minimum spanning tree problem: compact and convex uncertainty", ["xml:lang"] = "en", }, }, table#9630 { ["itemType"] = table#9631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2656973", }, ["subjectLabel"] = table#9633 { ["type"] = "literal", ["value"] = "A new approach to finding the extra connectivity of graphs", ["xml:lang"] = "en", }, }, table#9634 { ["itemType"] = table#9635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2657039", }, ["subjectLabel"] = table#9637 { ["type"] = "literal", ["value"] = "Sub-Ramsey numbers for matchings", ["xml:lang"] = "en", }, }, table#9638 { ["itemType"] = table#9639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2657058", }, ["subjectLabel"] = table#9641 { ["type"] = "literal", ["value"] = "\$P_3\$-factors in the square of a tree", ["xml:lang"] = "en", }, }, table#9642 { ["itemType"] = table#9643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2657283", }, ["subjectLabel"] = table#9645 { ["type"] = "literal", ["value"] = "On Turán number for \$S_{\\ell_1} \\cup S_{\\ell_2}\$", ["xml:lang"] = "en", }, }, table#9646 { ["itemType"] = table#9647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2658595", }, ["subjectLabel"] = table#9649 { ["type"] = "literal", ["value"] = "Three-dimensional steerable discrete cosine transform with application to 3D image compression", ["xml:lang"] = "en", }, }, table#9650 { ["itemType"] = table#9651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2659168", }, ["subjectLabel"] = table#9653 { ["type"] = "literal", ["value"] = "On \$g\$-good-neighbor conditional connectivity and diagnosability of hierarchical star networks", ["xml:lang"] = "en", }, }, table#9654 { ["itemType"] = table#9655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2659186", }, ["subjectLabel"] = table#9657 { ["type"] = "literal", ["value"] = "Long cycles through specified vertices", ["xml:lang"] = "en", }, }, table#9658 { ["itemType"] = table#9659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2659188", }, ["subjectLabel"] = table#9661 { ["type"] = "literal", ["value"] = "Disjoint directed cycles with specified lengths in directed bipartite graphs", ["xml:lang"] = "en", }, }, table#9662 { ["itemType"] = table#9663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2660963", }, ["subjectLabel"] = table#9665 { ["type"] = "literal", ["value"] = "A two-step communication opinion dynamics model with self-persistence and influence index for social networks based on the DeGroot model", ["xml:lang"] = "en", }, }, table#9666 { ["itemType"] = table#9667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2661071", }, ["subjectLabel"] = table#9669 { ["type"] = "literal", ["value"] = "Energy of inverse graphs of dihedral and symmetric groups", ["xml:lang"] = "en", }, }, table#9670 { ["itemType"] = table#9671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2662643", }, ["subjectLabel"] = table#9673 { ["type"] = "literal", ["value"] = "The partite saturation number of spider", ["xml:lang"] = "en", }, }, table#9674 { ["itemType"] = table#9675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2664002", }, ["subjectLabel"] = table#9677 { ["type"] = "literal", ["value"] = "Generating irreducible copositive matrices using the stable set problem", ["xml:lang"] = "en", }, }, table#9678 { ["itemType"] = table#9679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2664210", }, ["subjectLabel"] = table#9681 { ["type"] = "literal", ["value"] = "A sub-modular receding horizon solution for mobile multi-agent persistent monitoring", ["xml:lang"] = "en", }, }, table#9682 { ["itemType"] = table#9683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2664438", }, ["subjectLabel"] = table#9685 { ["type"] = "literal", ["value"] = "Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs", ["xml:lang"] = "en", }, }, table#9686 { ["itemType"] = table#9687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2666359", }, ["subjectLabel"] = table#9689 { ["type"] = "literal", ["value"] = "Non-commuting graphs and some bounds for commutativity degree of finite Moufang loops", ["xml:lang"] = "en", }, }, table#9690 { ["itemType"] = table#9691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2667641", }, ["subjectLabel"] = table#9693 { ["type"] = "literal", ["value"] = "Identifying influential links to control spreading of epidemics", ["xml:lang"] = "en", }, }, table#9694 { ["itemType"] = table#9695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2668336", }, ["subjectLabel"] = table#9697 { ["type"] = "literal", ["value"] = "The neighbour sum distinguishing relaxed edge colouring", ["xml:lang"] = "en", }, }, table#9698 { ["itemType"] = table#9699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2671079", }, ["subjectLabel"] = table#9701 { ["type"] = "literal", ["value"] = "Intersection graphs of graded ideals of graded rings", ["xml:lang"] = "en", }, }, table#9702 { ["itemType"] = table#9703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2671547", }, ["subjectLabel"] = table#9705 { ["type"] = "literal", ["value"] = "Unimodality of independence polynomials of the cycle cover product of graphs", ["xml:lang"] = "en", }, }, table#9706 { ["itemType"] = table#9707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2671849", }, ["subjectLabel"] = table#9709 { ["type"] = "literal", ["value"] = "The number of 4-cycles in a graph", ["xml:lang"] = "en", }, }, table#9710 { ["itemType"] = table#9711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2672585", }, ["subjectLabel"] = table#9713 { ["type"] = "literal", ["value"] = "The non-inclusive \$g\$-good-neighbor diagnosability of interconnection networks", ["xml:lang"] = "en", }, }, table#9714 { ["itemType"] = table#9715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2672591", }, ["subjectLabel"] = table#9717 { ["type"] = "literal", ["value"] = "Connectivity and constructive algorithms of disjoint paths in dragonfly networks", ["xml:lang"] = "en", }, }, table#9718 { ["itemType"] = table#9719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2672617", }, ["subjectLabel"] = table#9721 { ["type"] = "literal", ["value"] = "Suffix-connected languages", ["xml:lang"] = "en", }, }, table#9722 { ["itemType"] = table#9723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2672619", }, ["subjectLabel"] = table#9725 { ["type"] = "literal", ["value"] = "Connectivity and super connectivity of the exchanged 3-ary \$n\$-cube", ["xml:lang"] = "en", }, }, table#9726 { ["itemType"] = table#9727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2672953", }, ["subjectLabel"] = table#9729 { ["type"] = "literal", ["value"] = "Spectral determinations and eccentricity matrix of graphs", ["xml:lang"] = "en", }, }, table#9730 { ["itemType"] = table#9731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2673923", }, ["subjectLabel"] = table#9733 { ["type"] = "literal", ["value"] = "Degree powers of graphs without \$B_{\\ell,s}\$", ["xml:lang"] = "en", }, }, table#9734 { ["itemType"] = table#9735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2673969", }, ["subjectLabel"] = table#9737 { ["type"] = "literal", ["value"] = "Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time", ["xml:lang"] = "en", }, }, table#9738 { ["itemType"] = table#9739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2674157", }, ["subjectLabel"] = table#9741 { ["type"] = "literal", ["value"] = "Annihilator graphs of a commutative semigroup whose zero-divisor graphs are a complete graph with an end vertex", ["xml:lang"] = "en", }, }, table#9742 { ["itemType"] = table#9743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2675841", }, ["subjectLabel"] = table#9745 { ["type"] = "literal", ["value"] = "Two completely independent spanning trees of claw-free graphs", ["xml:lang"] = "en", }, }, table#9746 { ["itemType"] = table#9747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2676748", }, ["subjectLabel"] = table#9749 { ["type"] = "literal", ["value"] = "On the spectral radius of the generalized adjacency matrix of a digraph", ["xml:lang"] = "en", }, }, table#9750 { ["itemType"] = table#9751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2678257", }, ["subjectLabel"] = table#9753 { ["type"] = "literal", ["value"] = "On path-greedy geometric spanners", ["xml:lang"] = "en", }, }, table#9754 { ["itemType"] = table#9755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2678679", }, ["subjectLabel"] = table#9757 { ["type"] = "literal", ["value"] = "Fixed point results for generalized contraction mappings and cyclical mappings in \$b\$-metric spaces endowed with a digraph", ["xml:lang"] = "en", }, }, table#9758 { ["itemType"] = table#9759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2680179", }, ["subjectLabel"] = table#9761 { ["type"] = "literal", ["value"] = "Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model", ["xml:lang"] = "en", }, }, table#9762 { ["itemType"] = table#9763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2453816", }, ["subjectLabel"] = table#9765 { ["type"] = "literal", ["value"] = "On the signed star domination number of regular multigraphs", ["xml:lang"] = "en", }, }, table#9766 { ["itemType"] = table#9767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2454989", }, ["subjectLabel"] = table#9769 { ["type"] = "literal", ["value"] = "Some properties on \$f\$-edge covered critical graphs", ["xml:lang"] = "en", }, }, table#9770 { ["itemType"] = table#9771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2454996", }, ["subjectLabel"] = table#9773 { ["type"] = "literal", ["value"] = "Labelling of some planar graphs with a condition at distance two", ["xml:lang"] = "en", }, }, table#9774 { ["itemType"] = table#9775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2461313", }, ["subjectLabel"] = table#9777 { ["type"] = "literal", ["value"] = "Degree conditions for graphs to be fractional \$(a, b, n)\$-critical graphs", ["xml:lang"] = "en", }, }, table#9778 { ["itemType"] = table#9779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2461502", }, ["subjectLabel"] = table#9781 { ["type"] = "literal", ["value"] = "The spectrum of path factorization of bipartite multigraphs", ["xml:lang"] = "en", }, }, table#9782 { ["itemType"] = table#9783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2461516", }, ["subjectLabel"] = table#9785 { ["type"] = "literal", ["value"] = "A lower bound on the total signed domination numbers of graphs", ["xml:lang"] = "en", }, }, table#9786 { ["itemType"] = table#9787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2463936", }, ["subjectLabel"] = table#9789 { ["type"] = "literal", ["value"] = "New sufficient condition for Hamiltonian graphs", ["xml:lang"] = "en", }, }, table#9790 { ["itemType"] = table#9791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2466005", }, ["subjectLabel"] = table#9793 { ["type"] = "literal", ["value"] = "Local solutions for global problems in wireless networks", ["xml:lang"] = "en", }, }, table#9794 { ["itemType"] = table#9795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2467738", }, ["subjectLabel"] = table#9797 { ["type"] = "literal", ["value"] = "The bondage numbers and efficient dominations of vertex-transitive graphs", ["xml:lang"] = "en", }, }, table#9798 { ["itemType"] = table#9799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2468480", }, ["subjectLabel"] = table#9801 { ["type"] = "literal", ["value"] = "New integer linear programming approaches for course timetabling", ["xml:lang"] = "en", }, }, table#9802 { ["itemType"] = table#9803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2468686", }, ["subjectLabel"] = table#9805 { ["type"] = "literal", ["value"] = "On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index", ["xml:lang"] = "en", }, }, table#9806 { ["itemType"] = table#9807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2468697", }, ["subjectLabel"] = table#9809 { ["type"] = "literal", ["value"] = "Sharp bounds for the second Zagreb index of unicyclic graphs", ["xml:lang"] = "en", }, }, table#9810 { ["itemType"] = table#9811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2470012", }, ["subjectLabel"] = table#9813 { ["type"] = "literal", ["value"] = "NP-completeness of 4-incidence colorability of semi-cubic graphs", ["xml:lang"] = "en", }, }, table#9814 { ["itemType"] = table#9815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2471336", }, ["subjectLabel"] = table#9817 { ["type"] = "literal", ["value"] = "Some results on fractional \$n\$-factor-critical graphs", ["xml:lang"] = "en", }, }, table#9818 { ["itemType"] = table#9819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2471346", }, ["subjectLabel"] = table#9821 { ["type"] = "literal", ["value"] = "Binding number and Hamiltonian \$(g,f)\$-factors in graphs", ["xml:lang"] = "en", }, }, table#9822 { ["itemType"] = table#9823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2473041", }, ["subjectLabel"] = table#9825 { ["type"] = "literal", ["value"] = "The complete optimal stars-clustering-tree problem", ["xml:lang"] = "en", }, }, table#9826 { ["itemType"] = table#9827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2474880", }, ["subjectLabel"] = table#9829 { ["type"] = "literal", ["value"] = "Fault-tolerant Hamiltonian connectedness of cycle composition networks", ["xml:lang"] = "en", }, }, table#9830 { ["itemType"] = table#9831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2475314", }, ["subjectLabel"] = table#9833 { ["type"] = "literal", ["value"] = "Results of the maximum genus of graphs", ["xml:lang"] = "en", }, }, table#9834 { ["itemType"] = table#9835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2477388", }, ["subjectLabel"] = table#9837 { ["type"] = "literal", ["value"] = "The crossing number of \$K_{1,4,n}\$", ["xml:lang"] = "en", }, }, table#9838 { ["itemType"] = table#9839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2482884", }, ["subjectLabel"] = table#9841 { ["type"] = "literal", ["value"] = "Triangulating with high connectivity.", ["xml:lang"] = "en", }, }, table#9842 { ["itemType"] = table#9843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2483476", }, ["subjectLabel"] = table#9845 { ["type"] = "literal", ["value"] = "A homological solution for the Gauss code problem in arbitrary surfaces", ["xml:lang"] = "en", }, }, table#9846 { ["itemType"] = table#9847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2487989", }, ["subjectLabel"] = table#9849 { ["type"] = "literal", ["value"] = "The transformation graph \$G^{xyz}\$ when \$xyz=-++\$", ["xml:lang"] = "en", }, }, table#9850 { ["itemType"] = table#9851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2488234", }, ["subjectLabel"] = table#9853 { ["type"] = "literal", ["value"] = "On the fractional chromatic index of a graph and its complement", ["xml:lang"] = "en", }, }, table#9854 { ["itemType"] = table#9855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2489363", }, ["subjectLabel"] = table#9857 { ["type"] = "literal", ["value"] = "The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm", ["xml:lang"] = "en", }, }, table#9858 { ["itemType"] = table#9859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2492229", }, ["subjectLabel"] = table#9861 { ["type"] = "literal", ["value"] = "Two classes of edge domination in graphs", ["xml:lang"] = "en", }, }, table#9862 { ["itemType"] = table#9863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2494101", }, ["subjectLabel"] = table#9865 { ["type"] = "literal", ["value"] = "Super restricted edge connectivity of regular graphs", ["xml:lang"] = "en", }, }, table#9866 { ["itemType"] = table#9867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2494102", }, ["subjectLabel"] = table#9869 { ["type"] = "literal", ["value"] = "The determination of the total chromatic number of series-parallel graphs with \$(G) \\geq 4\$", ["xml:lang"] = "en", }, }, table#9870 { ["itemType"] = table#9871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2494104", }, ["subjectLabel"] = table#9873 { ["type"] = "literal", ["value"] = "Fan-type theorem for long cycles containing a specified edge", ["xml:lang"] = "en", }, }, table#9874 { ["itemType"] = table#9875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2494108", }, ["subjectLabel"] = table#9877 { ["type"] = "literal", ["value"] = "On group chromatic number of graphs", ["xml:lang"] = "en", }, }, table#9878 { ["itemType"] = table#9879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2494117", }, ["subjectLabel"] = table#9881 { ["type"] = "literal", ["value"] = "On the pancyclicity of lexicographic products", ["xml:lang"] = "en", }, }, table#9882 { ["itemType"] = table#9883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2494125", }, ["subjectLabel"] = table#9885 { ["type"] = "literal", ["value"] = "On resolvable multipartite \$G\$-designs. II", ["xml:lang"] = "en", }, }, table#9886 { ["itemType"] = table#9887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2496188", }, ["subjectLabel"] = table#9889 { ["type"] = "literal", ["value"] = "Non-commuting graph of a group.", ["xml:lang"] = "en", }, }, table#9890 { ["itemType"] = table#9891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2501210", }, ["subjectLabel"] = table#9893 { ["type"] = "literal", ["value"] = "On the doubly connected domination number of a graph", ["xml:lang"] = "en", }, }, table#9894 { ["itemType"] = table#9895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2501435", }, ["subjectLabel"] = table#9897 { ["type"] = "literal", ["value"] = "Partition a graph with small diameter into two induced matchings", ["xml:lang"] = "en", }, }, table#9898 { ["itemType"] = table#9899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2504084", }, ["subjectLabel"] = table#9901 { ["type"] = "literal", ["value"] = "Weak embedding of planar graphs", ["xml:lang"] = "en", }, }, table#9902 { ["itemType"] = table#9903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2506823", }, ["subjectLabel"] = table#9905 { ["type"] = "literal", ["value"] = "Sports tournaments, home-away assignments, and the break minimization problem", ["xml:lang"] = "en", }, }, table#9906 { ["itemType"] = table#9907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2508614", }, ["subjectLabel"] = table#9909 { ["type"] = "literal", ["value"] = "Non-bipartite graphs with third largest Laplacian eigenvalue less than three", ["xml:lang"] = "en", }, }, table#9910 { ["itemType"] = table#9911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2508633", }, ["subjectLabel"] = table#9913 { ["type"] = "literal", ["value"] = "On 2-factors with prescribed properties in a bipartite graph", ["xml:lang"] = "en", }, }, table#9914 { ["itemType"] = table#9915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2511081", }, ["subjectLabel"] = table#9917 { ["type"] = "literal", ["value"] = "The starlike trees with maximum and minimum second order connectivity index", ["xml:lang"] = "en", }, }, table#9918 { ["itemType"] = table#9919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2511400", }, ["subjectLabel"] = table#9921 { ["type"] = "literal", ["value"] = "More on the Harary index of cacti", ["xml:lang"] = "en", }, }, table#9922 { ["itemType"] = table#9923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2511464", }, ["subjectLabel"] = table#9925 { ["type"] = "literal", ["value"] = "The Harary index of ordinary and generalized quasi-tree graphs", ["xml:lang"] = "en", }, }, table#9926 { ["itemType"] = table#9927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2512654", }, ["subjectLabel"] = table#9929 { ["type"] = "literal", ["value"] = "On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups", ["xml:lang"] = "en", }, }, table#9930 { ["itemType"] = table#9931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2514004", }, ["subjectLabel"] = table#9933 { ["type"] = "literal", ["value"] = "Neighbor sum distinguishing total colorings of \$K_4\$-minor free graphs", ["xml:lang"] = "en", }, }, table#9934 { ["itemType"] = table#9935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2514165", }, ["subjectLabel"] = table#9937 { ["type"] = "literal", ["value"] = "Labeled 2-packings of trees", ["xml:lang"] = "en", }, }, table#9938 { ["itemType"] = table#9939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2517156", }, ["subjectLabel"] = table#9941 { ["type"] = "literal", ["value"] = "Statuses and double branch weights of quadrangular outerplanar graphs", ["xml:lang"] = "en", }, }, table#9942 { ["itemType"] = table#9943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2563421", }, ["subjectLabel"] = table#9945 { ["type"] = "literal", ["value"] = "Perfect matchings in regular bipartite graphs", ["xml:lang"] = "en", }, }, table#9946 { ["itemType"] = table#9947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2563513", }, ["subjectLabel"] = table#9949 { ["type"] = "literal", ["value"] = "Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph", ["xml:lang"] = "en", }, }, table#9950 { ["itemType"] = table#9951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2565846", }, ["subjectLabel"] = table#9953 { ["type"] = "literal", ["value"] = "Eigenvectors of interval matrices over max--plus algebra", ["xml:lang"] = "en", }, }, table#9954 { ["itemType"] = table#9955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2566009", }, ["subjectLabel"] = table#9957 { ["type"] = "literal", ["value"] = "Strong Rabin numbers of folded hypercubes", ["xml:lang"] = "en", }, }, table#9958 { ["itemType"] = table#9959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2568486", }, ["subjectLabel"] = table#9961 { ["type"] = "literal", ["value"] = "Quartic half-arc-transitive graphs with large vertex stabilizers", ["xml:lang"] = "en", }, }, table#9962 { ["itemType"] = table#9963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2572280", }, ["subjectLabel"] = table#9965 { ["type"] = "literal", ["value"] = "Powers of matrices over distributive lattices -- a review", ["xml:lang"] = "en", }, }, table#9966 { ["itemType"] = table#9967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2574329", }, ["subjectLabel"] = table#9969 { ["type"] = "literal", ["value"] = "The classification of complete graphs \$K_n\$ on \$f\$-coloring", ["xml:lang"] = "en", }, }, table#9970 { ["itemType"] = table#9971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2581633", }, ["subjectLabel"] = table#9973 { ["type"] = "literal", ["value"] = "The relation of matching with inverse degree of a graph", ["xml:lang"] = "en", }, }, table#9974 { ["itemType"] = table#9975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2583127", }, ["subjectLabel"] = table#9977 { ["type"] = "literal", ["value"] = "Critical extreme points of the 2-edge connected spanning subgraph polytope", ["xml:lang"] = "en", }, }, [0] = table#9978 { ["itemType"] = table#9979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#9980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q595674", }, ["subjectLabel"] = table#9981 { ["type"] = "literal", ["value"] = "Duality and perfection for edges in cliques", ["xml:lang"] = "en", }, }, }, }, } table#1 { ["head"] = table#2 { ["vars"] = table#3 { "propertyLabel", "value", "valueLabel", [0] = "property", }, }, ["results"] = table#4 { ["bindings"] = table#5 { }, }, } table#1 { ["head"] = table#2 { ["vars"] = table#3 { "propertyLabel", "value", "valueLabel", [0] = "property", }, }, ["results"] = table#4 { ["bindings"] = table#5 { }, }, }

scientific article