5 papers
On the maximum diameter of -colorable graphs
Éva Czabarka, Inne Singgih, László A. Székely
Erdős, Pach, Pollack and Tuza [J. Combin. Theory, B 47, (1989), 279-285] conjectured that the diameter of a -free connected graph of order and minimum degree …
Antimagic orientations of graphs with large maximum degree
Donglei Yang, Joshua Carlson, Andrew Owens +5
Given a digraph with arcs, a bijection is an antimagic labeling of if no two vertices in have the same vertex-sum, where t…
Some remarks on the midrange crossing constant
É. Czabarka, I. Singgih, L. A. Székely +1
We verify an upper bound of Pach and Tóth [Combinatorica 17(1997), 427-439, Discrete and Computational Geometry 36(2006), 527-552] on the midrange crossing constant. Details of the…
DNA graph characterization for the line digraph of dicycle with chords, -digraph , and 3-blade-propeller
Inne Singgih
DNA graph has important contribution in completing the computational step of DNA sequencing process. Using -labeling, several families of digraphs have characterized as DNA…
Subtractive Magic and Antimagic Total Labeling for Basic Families of Graphs
Inne Singgih
A \textit{subtractive arc-magic labeling} (SAML) of a directed graph is a bijection with the property that for every we h…