Finding Hamilton cycles in random intersection graphs by Katarzyna Rybarczyk

Subjects: Get full text

Further results on Parity Combination Cordial Labeling by Mohamed Seoud, Mohamed Aboshady

Subjects: Get full text

Minimal Graphs with Disjoint Dominating and Paired-Dominating Sets by Henning Michael A., Topp Jerzy

Subjects: Get full text

Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids by Tom Shlomi

Subjects: Get full text

Open k-monopolies in graphs: complexity and related concepts by Dorota Kuziak, Iztok Peterin, Ismael G. Yero

Subjects: Get full text

The Neighborhood Polynomial of Chordal Graphs by Helena Bergold, Winfried Hochstättler, Uwe Mayer

Subjects: Get full text

On rank-width of even-hole-free graphs by Isolde Adler, Ngoc Khang Le, Haiko Müller, Marko Radovanović, Nicolas Trotignon, Kristina Vušković

Subjects: Get full text

Trees Whose Even-Degree Vertices Induce a Path are Antimagic by Lozano Antoni, Mora Mercè, Seara Carlos, Tey Joaquín

Subjects: Get full text

Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3] by Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva

Subjects: Get full text

On partial sorting in restricted rounds by Iványi Antal, Fogarasi Norbert

Subjects: “…05c85…”
Get full text

On the monophonic rank of a graph by Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva

Subjects: Get full text

Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs by Luerbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira

Subjects: Get full text

A linear algorithm for obtaining the Laplacian eigenvalues of a cograph by Chen Guantao, Tura Fernando C.

Subjects: Get full text

A Linear Kernel for Planar Total Dominating Set by Valentin Garnero, Ignasi Sau

Subjects: Get full text

An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs by Tu Jianhua, Shi Yongtang

Subjects: Get full text

Sensitivity analysis and application of single-valued neutrosophic transportaion problem by M. Kanchana, K. Kavitha

Subjects: Get full text

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs by Hanna Furmańczyk, Vahan Mkrtchyan

Subjects: Get full text

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width by M. Rajaati, M. R. Hooshmandasl, M. J. Dinneen, A. Shakiba

Subjects: Get full text

Bounds for the smallest $k$-chromatic graphs of given girth by Geoffrey Exoo, Jan Goedgebeur

Subjects: Get full text

Determining the Hausdorff Distance Between Trees in Polynomial Time by Aleksander Kelenc

Subjects: Get full text