Journal
Jornal
RDF description of Discrete applied mathematics combinatorial algorithms operations research and computer science - https://brcris.ibict.br/individual/journ_aa3d939f-1e28-47d8-b15b-f22f9c8742f3
Short proofs on the structure of general partition, equistable and triangle graphs
A compact quadratic model and linearizations for the minimum linear arrangement problem
Minimum 2-dominating sets in regular graphs
Constant threshold intersection graphs of orthodox paths in trees
Backbone coloring of graphs with galaxy backbones
An integer programming approach for solving a generalized version of the Grundy domination number
Hull and geodetic numbers for some classes of oriented graphs
Complexity-separating graph classes for vertex, edge and total colouring
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
Intersection of longest paths in graph classes
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
Graphs with many edge-colorings such that complete graphs are rainbow
Positive semidefiniteness of A α ( G ) on some f
Bounding the sum of the largest signless Laplacian eigenvalues of a graph
Percolation centrality via Rademacher Complexity
Hardness and efficiency on -admissibility for graph operations
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
The Solitaire Clobber game and correducibility of graphs
On the generalized Helly property of hypergraphs, cliques, and bicliques
On the complexity of the Cable-Trench Problem
On subclasses of interval count two and on Fishburn’s conjecture
Edge-colouring graphs with bounded local degree sums
Determining equitable total chromatic number for infinite classes of complete r -partite graphs
On the computational complexity of closest genome problems
On the - -interval and the - -convexity numbers of graphs and graph products
Rainbow connectivity and rainbow criticality on graph classes
Unit form recognition by mutations: Application of mutations in the search of positive roots
Computing the zig-zag number of directed graphs
Graphs without gap-vertex-labellings: Families and bounds
Interactive unawareness in the graph model for multilateral conflicts
P 3 -convexity on graphs with diameter two: Computing hull and interval numbers
Exploring symmetries in cographs: Obtaining spectra and energies
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem
Models and algorithms for the Weighted Safe Set Problem
On the structure of the inverse of non-singular unicyclic graphs
Target set selection with maximum activation time
New bounds for the b-chromatic number of vertex deleted graphs
Connected greedy coloring of H -free graphs
MATEMATICA / PROBABILIDADE E ESTATISTICA
Domination and convexity problems in the target set selection model
Matrices inducing generalized metric on sequences
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
On the Nash number and the diminishing Grundy number of a graph
Revising Johnson?s table for the 21st century
The Overfull Conjecture on split-comparability and split-interval graphs
Strong intractability results for generalized convex recoloring problems
Decomposing split graphs into locally irregular graphs
Global defensive alliances in the lexicographic product of paths and cycles
On gap-labellings of some families of graphs
Discrete applied mathematics combinatorial algorithms operations research and computer science
Complexity aspects of - -chord convexities
Characterizations, probe and sandwich problems on ( k , - ) -cographs
Non-inclusion and other subclasses of chordal graphs
Partitioning P 4 -tidy graphs into a stable set and a forest
Edge clique partition in ( k , - ) -graphs
Total tessellation cover: bounds, hardness, and applications
Results about the total chromatic number and the conformability of some families of circulant graphs