Publication | Date of Publication | Type |
---|
Complete bipartite graphs without small rainbow subgraphs | 2024-02-14 | Paper |
On the distance-edge-monitoring numbers of graphs | 2024-01-24 | Paper |
Size Gallai-Ramsey number | 2024-01-05 | Paper |
Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs | 2023-10-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q6076150 | 2023-10-23 | Paper |
Complete bipartite graphs without small rainbow stars | 2023-09-14 | Paper |
Gallai-Ramsey numbers involving a rainbow 4-path | 2023-05-26 | Paper |
Edge-disjoint Steiner trees and connectors in graphs | 2023-04-28 | Paper |
Gallai-Ramsey numbers for fans | 2023-03-10 | Paper |
Ramsey Achievement Games on Graphs : Algorithms and Bounds | 2023-03-06 | Paper |
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs | 2023-02-21 | Paper |
Gallai-Ramsey Multiplicity | 2023-02-20 | Paper |
Constructing edge-disjoint Steiner trees in Cartesian product networks | 2023-01-26 | Paper |
Popoviciu type inequalities for determinants | 2023-01-05 | Paper |
Ramsey and Gallai-Ramsey numbers for the union of paths and stars | 2022-12-08 | Paper |
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings | 2022-10-14 | Paper |
Euclidean Gallai-Ramsey Theory | 2022-09-27 | Paper |
Gallai-Ramsey number for the union of stars | 2022-09-12 | Paper |
Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels | 2022-08-24 | Paper |
Fractional Matching Preclusion for (n,k)-Star Graphs | 2022-07-04 | Paper |
On relations between Sombor and other degree-based indices | 2022-05-31 | Paper |
A general approach to deriving diagnosability results of interconnection networks | 2022-04-06 | Paper |
Ramsey and Gallai-Ramsey number for wheels | 2022-03-15 | Paper |
Some multivariable Rado numbers | 2022-03-05 | Paper |
Fractional matching preclusion number of graphs | 2022-03-04 | Paper |
A note on maximum fractional matchings of graphs | 2022-02-14 | Paper |
Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree | 2022-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5012989 | 2021-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5012995 | 2021-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5165198 | 2021-11-15 | Paper |
Steiner (revised) Szeged index of graphs | 2021-10-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5156355 | 2021-10-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q5156431 | 2021-10-15 | Paper |
Generalized connectivity of some total graphs | 2021-09-16 | Paper |
Bounds for the spectral radius and energy of extended adjacency matrix of graphs | 2021-09-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5011051 | 2021-08-26 | Paper |
Steiner Degree Distance of Two Graph Products | 2021-07-28 | Paper |
Nordhaus-Guddum type results for the Steiner Gutman index of graphs | 2021-07-09 | Paper |
Steiner diameter, maximum degree and size of a graph | 2021-06-14 | Paper |
Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs | 2021-03-17 | Paper |
On cycles that alternate through selected sets of vertices | 2021-02-16 | Paper |
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph | 2021-02-10 | Paper |
Inequalities for the Heinz mean of sector matrices | 2021-01-05 | Paper |
Note on the connectivity keeping spiders in $k$-connected graphs | 2020-12-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q5133103 | 2020-11-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q5133269 | 2020-11-12 | Paper |
A note on the strong matching preclusion problem for data center networks | 2020-10-07 | Paper |
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges | 2020-08-31 | Paper |
Note on matching preclusion number of random graphs | 2020-08-03 | Paper |
Bounds for Gallai-Ramsey functions and numbers | 2020-07-08 | Paper |
Strong geodetic number of graphs and connectivity | 2020-04-23 | Paper |
Fractional matching preclusion for generalized augmented cubes | 2020-01-13 | Paper |
Gallai Ramsey number for double stars | 2020-01-08 | Paper |
Conflict-free vertex-connections of graphs | 2020-01-08 | Paper |
On the \(g\)-good-neighbor connectivity of graphs | 2019-12-27 | Paper |
Fractional matching preclusion for arrangement graphs | 2019-11-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5241134 | 2019-10-30 | Paper |
The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products | 2019-10-02 | Paper |
Gallai-Ramsey numbers for books | 2019-09-19 | Paper |
On the $g$-extra connectivity of graphs | 2019-04-13 | Paper |
Constructing edge-disjoint Steiner paths in lexicographic product networks | 2019-03-29 | Paper |
Invulnerability of planar two-tree networks | 2019-03-26 | Paper |
Gallai-Ramsey numbers for fans | 2019-02-27 | Paper |
On conflict-free connection of graphs | 2019-02-20 | Paper |
Matching preclusion number in product graphs | 2019-02-14 | Paper |
A result on the 3-generalized connectivity of a graph and its line graph | 2019-01-31 | Paper |
Proper connection number of graph products | 2019-01-31 | Paper |
The Steiner diameter of a graph | 2019-01-25 | Paper |
Matching preclusion number of graphs | 2019-01-18 | Paper |
Steiner Distance in Product Networks | 2018-12-10 | Paper |
Gallai-Ramsey numbers of odd cycles | 2018-08-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4566360 | 2018-06-14 | Paper |
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks | 2018-04-10 | Paper |
Conflict-free connection numbers of line graphs | 2018-02-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4604120 | 2018-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4604133 | 2018-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3134338 | 2018-02-09 | Paper |
Strong matching preclusion number of graphs | 2018-02-06 | Paper |
Inverse problem on the Steiner Wiener index | 2018-01-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5367789 | 2017-10-20 | Paper |
Steiner Distance in Graphs--A Survey | 2017-08-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4977514 | 2017-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5279093 | 2017-07-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5273076 | 2017-07-05 | Paper |
Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs | 2017-05-23 | Paper |
Steiner diameter, maximum degree and size of a graph | 2017-04-15 | Paper |
The Steiner (n-3)-diameter of a graph | 2017-03-11 | Paper |
A solution to a conjecture on the generalized connectivity of graphs | 2017-03-03 | Paper |
The Steiner 4-diameter of a graph | 2017-02-18 | Paper |
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs | 2017-01-23 | Paper |
Graphs with large generalized (edge-)connectivity | 2016-11-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q2829070 | 2016-10-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q2824017 | 2016-10-06 | Paper |
Generalized Connectivity of Graphs | 2016-08-10 | Paper |
A small-world network derived from the deterministic uniform recursive tree by line graph operation | 2016-08-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5741027 | 2016-07-20 | Paper |
Rainbow vertex-connection and graph products | 2016-07-19 | Paper |
The vertex-rainbow index of a graph | 2016-07-13 | Paper |
Path-connectivity of lexicographic product graphs | 2016-05-06 | Paper |
The minimal size of a graph with given generalized 3-edge-connectivity | 2016-05-04 | Paper |
The Steiner Wiener index of a graph | 2016-04-25 | Paper |
The minimal size of graphs with given pendant-tree connectivity | 2016-04-23 | Paper |
Monochromatic connectivity and graph products | 2016-04-12 | Paper |
Pendant-tree connectivity of line graphs | 2016-04-07 | Paper |
Line k-Arboricity in Product Networks | 2016-03-13 | Paper |
Path connectivity of line graphs | 2016-03-12 | Paper |
The complexity of determining the vertex-rainbow index of graphs | 2016-02-22 | Paper |
On the equitable vertex arboricity of complete tripartite graphs | 2016-02-22 | Paper |
Searching for (near) Optimal Codes | 2016-02-05 | Paper |
ON THE MERRIFIELD-SIMMONS INDEX AND HOSOYA INDEX OF TREE-TRIANGLE GRAPHS | 2016-01-11 | Paper |
On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices | 2015-12-17 | Paper |
The equitable vertex arboricity of complete tripartite graphs | 2015-09-15 | Paper |
On the pedant tree-connectivity of graphs | 2015-08-28 | Paper |
Interval minors of complete multipartite graphs | 2015-08-05 | Paper |
On the Equitable Vertex Arboricity of Graphs | 2015-05-30 | Paper |
On the regular k-independence number of graphs | 2015-05-19 | Paper |
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs | 2015-04-28 | Paper |
Graphs with large generalized 3-connectivity | 2015-04-13 | Paper |
Note on the spanning-tree packing number of lexicographic product graphs | 2015-01-30 | Paper |
On extremal graphs with internally disjoint Steiner trees | 2014-08-25 | Paper |
On the generalized (edge-)connectivity of graphs | 2014-08-15 | Paper |
The generalized 3-connectivity of Lexicographic product graphs | 2014-07-01 | Paper |
The strong rainbow vertex-connection of graphs | 2014-06-11 | Paper |
Additive codes over $GF(4)$ from circulant graphs | 2014-03-31 | Paper |
Formally self-dual linear binary codes from circulant graphs | 2014-02-25 | Paper |
Lower bounds for the spanning tree numbers of two graph products | 2013-07-09 | Paper |
Further hardness results on the generalized connectivity of graphs | 2013-04-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4901472 | 2013-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2906259 | 2012-09-05 | Paper |
A survey on the generalized connectivity of graphs | 2012-07-08 | Paper |