Tithi Dwary

According to our database, Tithi Dwary authored at least 10 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2026

Characterization of double-arborescences and their minimum length word-representants.

Tithi Dwary, Kanduru V. Krishna

Discret. Appl. Math., 2026

Minimum Length Word-Representants of Treelike Permutation Graphs.

Tithi Dwary, Kanduru V. Krishna

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

Boxicity of a Class of Split Graphs Using Words.

Khyodeno Mozhui, Tithi Dwary

Proceedings of the Algorithms and Discrete Applied Mathematics, 2026

2025

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable.

Khyodeno Mozhui, Tithi Dwary, Kanduru V. Krishna

CoRR, September, 2025

Characterization of Split Comparability Graphs.

Tithi Dwary, Khyodeno Mozhui, Kanduru V. Krishna

CoRR, April, 2025

Word-Representability of Well-Partitioned Chordal Graphs.

Tithi Dwary, Kanduru V. Krishna

CoRR, April, 2025

Representation Number of Word-Representable Split Graphs.

Tithi Dwary, Khyodeno Mozhui, Kanduru V. Krishna

CoRR, February, 2025

2024

Word-representability of graphs with respect to split recomposition.

Tithi Dwary, Kanduru V. Krishna

Discret. Appl. Math., 2024

Characterization of Word-Representable Graphs using Modular Decomposition.

Tithi Dwary, Kanduru V. Krishna

CoRR, 2024

Characterization of Double-Arborescences and their Minimum-Word-Representants.

Tithi Dwary, Kanduru V. Krishna

CoRR, 2024