Journal
type: Class
label: Jornal @pt-br

RDF description of Discrete applied mathematics combinatorial algorithms operations research and computer science - https://brcris.ibict.br/individual/journ_aa3d939f-1e28-47d8-b15b-f22f9c8742f3
type: Document
rights: termsOfUse
date: 2025-12-23T17:39:50
publisher: brcris.ibict.br

Discrete applied mathematics combinatorial algorithms operations research and computer science
type: Journal
publisher: Elsevier BV
i10 index: 3614
qualis classification: A2
is in doaj: False
has subject area: ENGENHARIAS III
type: journal
is oa: False
issn: 1872-6771
has subject area: MATEMATICA / PROBABILIDADE E ESTATISTICA
has subject area: INTERDISCIPLINAR
has subject area: ECONOMIA
two year mean cite: 0.9502369668246445
openalex identifier: https://openalex.org/S171741597
issnl: 0166-218X
has subject area: CIENCIA DA COMPUTACAO
h index: 128
issn: 0166-218X
country code: NL

Short proofs on the structure of general partition, equistable and triangle graphs
type: Thing
type: Error6
type: Error1
type: IAO_0000030
type: Document
type: BFO_0000002
type: Error5
type: Error4
type: BFO_0000001
type: Error2
type: BFO_0000031
type: Error3

Path eccentricity of graphs
type: Error5
type: Error6
type: BFO_0000001
type: Error3
type: Document
type: BFO_0000002
type: Error4
type: Thing
type: BFO_0000031
type: Error1
type: Error2
type: IAO_0000030

A compact quadratic model and linearizations for the minimum linear arrangement problem
type: Error2
type: IAO_0000030
type: BFO_0000002
type: BFO_0000031
type: Error6
type: Error1
type: Error4
type: BFO_0000001
type: Thing
type: Error5
type: Error3
type: Document

Minimum 2-dominating sets in regular graphs
type: BFO_0000002
type: Error2
type: Error5
type: Thing
type: BFO_0000001
type: Error4
type: BFO_0000031
type: Error1
type: IAO_0000030
type: Error3
type: Error6
type: Document

Constant threshold intersection graphs of orthodox paths in trees
type: Error2
type: Document
type: Error3
type: Error6
type: Error1
type: BFO_0000002
type: BFO_0000031
type: IAO_0000030
type: Error5
type: Thing
type: BFO_0000001
type: Error4

Backbone coloring of graphs with galaxy backbones
type: Error5
type: Error2
type: BFO_0000001
type: IAO_0000030
type: Document
type: Error6
type: Error3
type: BFO_0000002
type: Error4
type: Error1
type: Thing
type: BFO_0000031

Biclique graphs of split graphs
type: Error6
type: Thing
type: Error1
type: Document
type: IAO_0000030
type: BFO_0000031
type: BFO_0000001
type: Error2
type: Error3
type: BFO_0000002
type: Error5
type: Error4

An integer programming approach for solving a generalized version of the Grundy domination number
type: Error6
type: Error4
type: BFO_0000031
type: Document
type: Error1
type: Error2
type: IAO_0000030
type: BFO_0000001
type: Error5
type: Error3
type: Thing
type: BFO_0000002

Hull and geodetic numbers for some classes of oriented graphs
type: Thing
type: Error1
type: Error2
type: Document
type: Error3
type: IAO_0000030
type: Error5
type: Error4
type: BFO_0000001
type: Error6
type: BFO_0000002
type: BFO_0000031

Complexity-separating graph classes for vertex, edge and total colouring
type: Error6
type: Error1
type: BFO_0000031
type: IAO_0000030
type: Document
type: Thing
type: Error2
type: Error3
type: BFO_0000001
type: Error4
type: BFO_0000002
type: Error5

Compositions, decompositions, and conformability for total coloring on power of cycle graphs
type: Error1
type: Error6
type: Error3
type: IAO_0000030
type: BFO_0000031
type: Error2
type: Thing
type: BFO_0000001
type: Error4
type: Error5
type: BFO_0000002
type: Document

Intersection graph of maximal stars
type: IAO_0000030
type: Error5
type: Error2
type: BFO_0000002
type: Error6
type: Error3
type: Document
type: Thing
type: BFO_0000031
type: Error4
type: Error1
type: BFO_0000001

Intersection of longest paths in graph classes
type: Error3
type: BFO_0000031
type: Error1
type: Error6
type: IAO_0000030
type: Thing
type: Error4
type: Error2
type: BFO_0000001
type: Document
type: Error5
type: BFO_0000002

A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
type: BFO_0000031
type: Error6
type: Error5
type: IAO_0000030
type: BFO_0000002
type: Error4
type: BFO_0000001
type: Error3
type: Error2
type: Thing
type: Error1
type: Document

Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
type: Error6
type: Document
type: Error5
type: BFO_0000031
type: IAO_0000030
type: BFO_0000002
type: Error2
type: BFO_0000001
type: Error1
type: Error4
type: Thing
type: Error3

Graphs with many edge-colorings such that complete graphs are rainbow
type: Error4
type: BFO_0000031
type: IAO_0000030
type: Error3
type: Thing
type: Error2
type: Error1
type: Document
type: Error6
type: BFO_0000002
type: Error5
type: BFO_0000001

Positive semidefiniteness of A α ( G ) on some f
type: Error6
type: BFO_0000002
type: Error5
type: Error4
type: Thing
type: BFO_0000001
type: BFO_0000031
type: Error3
type: Error2
type: Error1
type: Document
type: IAO_0000030

Bounding the sum of the largest signless Laplacian eigenvalues of a graph
type: Error3
type: Error2
type: Error5
type: Document
type: IAO_0000030
type: BFO_0000002
type: Thing
type: Error1
type: BFO_0000031
type: BFO_0000001
type: Error4
type: Error6

Percolation centrality via Rademacher Complexity
type: BFO_0000002
type: Error5
type: Thing
type: Document
type: Error3
type: Error6
type: Error4
type: Error1
type: BFO_0000001
type: IAO_0000030
type: Error2
type: BFO_0000031

Hardness and efficiency on -admissibility for graph operations
type: Error4
type: Thing
type: Error3
type: Document
type: Error6
type: Error5
type: IAO_0000030
type: BFO_0000031
type: Error2
type: Error1
type: BFO_0000002
type: BFO_0000001

Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
type: Error3
type: Error5
type: Error4
type: Error6
type: BFO_0000001
type: BFO_0000002
type: Thing
type: Error1
type: BFO_0000031
type: Error2
type: Document
type: IAO_0000030

ENGENHARIAS III
type: Concept
type: Thing

On hyper-Hamiltonicity in graphs
type: IAO_0000030
type: Error4
type: Error6
type: Error3
type: Error5
type: Error2
type: Document
type: Error1
type: BFO_0000002
type: BFO_0000031
type: BFO_0000001
type: Thing

Biclique graphs of interval bigraphs
type: Error1
type: Document
type: Error4
type: Error6
type: BFO_0000031
type: Error3
type: Error5
type: BFO_0000002
type: IAO_0000030
type: BFO_0000001
type: Thing
type: Error2

The Solitaire Clobber game and correducibility of graphs
type: Error2
type: BFO_0000001
type: BFO_0000002
type: Error5
type: Error6
type: Thing
type: BFO_0000031
type: Error3
type: Document
type: IAO_0000030
type: Error4
type: Error1

On the generalized Helly property of hypergraphs, cliques, and bicliques
type: Error3
type: IAO_0000030
type: Error6
type: BFO_0000002
type: Document
type: Error2
type: Error5
type: BFO_0000001
type: Thing
type: Error4
type: Error1
type: BFO_0000031

On the complexity of the Cable-Trench Problem
type: Error6
type: BFO_0000002
type: Error4
type: Error1
type: BFO_0000031
type: Thing
type: Document
type: Error2
type: Error5
type: BFO_0000001
type: IAO_0000030
type: Error3

On subclasses of interval count two and on Fishburn’s conjecture
type: Error3
type: BFO_0000002
type: Document
type: Error4
type: IAO_0000030
type: Error1
type: Error2
type: BFO_0000031
type: Error5
type: Error6
type: Thing
type: BFO_0000001

Edge-colouring graphs with bounded local degree sums
type: Error6
type: BFO_0000001
type: IAO_0000030
type: Error5
type: Thing
type: Error2
type: Error1
type: BFO_0000031
type: Error4
type: Document
type: Error3
type: BFO_0000002

Determining equitable total chromatic number for infinite classes of complete r -partite graphs
type: Error2
type: Document
type: Thing
type: Error3
type: Error5
type: BFO_0000001
type: Error4
type: Error1
type: Error6
type: BFO_0000002
type: BFO_0000031
type: IAO_0000030

On the computational complexity of closest genome problems
type: Error5
type: Error6
type: BFO_0000031
type: Error3
type: Thing
type: Error4
type: BFO_0000001
type: Error1
type: Document
type: BFO_0000002
type: Error2
type: IAO_0000030

On the - -interval and the - -convexity numbers of graphs and graph products
type: Error1
type: Error2
type: Document
type: BFO_0000031
type: Error3
type: Error4
type: IAO_0000030
type: Error5
type: Error6
type: BFO_0000001
type: BFO_0000002
type: Thing

Anti-Ramsey threshold of cycles
type: IAO_0000030
type: Error2
type: Error1
type: BFO_0000002
type: BFO_0000001
type: Error6
type: BFO_0000031
type: Error5
type: Error4
type: Document
type: Thing
type: Error3

Rainbow connectivity and rainbow criticality on graph classes
type: BFO_0000001
type: Error1
type: Error6
type: Thing
type: IAO_0000030
type: BFO_0000002
type: Error2
type: Error3
type: BFO_0000031
type: Error4
type: Error5
type: Document

Unit form recognition by mutations: Application of mutations in the search of positive roots
type: IAO_0000030
type: BFO_0000001
type: Error2
type: Error3
type: Thing
type: Error5
type: BFO_0000002
type: Document
type: Error4
type: Error6
type: BFO_0000031
type: Error1

Computing the zig-zag number of directed graphs
type: Error3
type: Error6
type: Document
type: BFO_0000002
type: BFO_0000031
type: IAO_0000030
type: Error2
type: Error5
type: BFO_0000001
type: Error1
type: Error4
type: Thing

Graphs without gap-vertex-labellings: Families and bounds
type: Error5
type: Thing
type: Error2
type: IAO_0000030
type: Error1
type: Error4
type: BFO_0000002
type: Error6
type: Document
type: BFO_0000031
type: Error3
type: BFO_0000001

Leafy spanning arborescences in DAGs
type: Error3
type: Error2
type: BFO_0000031
type: IAO_0000030
type: Error4
type: BFO_0000001
type: Error5
type: Document
type: BFO_0000002
type: Thing
type: Error1
type: Error6

Interactive unawareness in the graph model for multilateral conflicts
type: Error5
type: Error3
type: Error2
type: IAO_0000030
type: Error1
type: BFO_0000002
type: BFO_0000031
type: Error6
type: Thing
type: Error4
type: Document
type: BFO_0000001

P 3 -convexity on graphs with diameter two: Computing hull and interval numbers
type: Error5
type: IAO_0000030
type: Error2
type: Thing
type: BFO_0000002
type: Error4
type: BFO_0000031
type: Error6
type: Error1
type: BFO_0000001
type: Document
type: Error3

The biclique partitioning polytope
type: Error2
type: BFO_0000002
type: Error1
type: BFO_0000001
type: Document
type: IAO_0000030
type: Error6
type: Error5
type: Error4
type: BFO_0000031
type: Error3
type: Thing

Exploring symmetries in cographs: Obtaining spectra and energies
type: BFO_0000001
type: IAO_0000030
type: Error6
type: Thing
type: Error5
type: Document
type: BFO_0000031
type: Error2
type: Error1
type: Error4
type: BFO_0000002
type: Error3

On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem
type: Thing
type: IAO_0000030
type: Error1
type: Error4
type: Error6
type: BFO_0000031
type: Document
type: Error3
type: BFO_0000002
type: Error5
type: Error2
type: BFO_0000001

Models and algorithms for the Weighted Safe Set Problem
type: Thing
type: Error4
type: IAO_0000030
type: Error1
type: BFO_0000002
type: BFO_0000031
type: Error3
type: Error6
type: BFO_0000001
type: Document
type: Error5
type: Error2

On the structure of the inverse of non-singular unicyclic graphs
type: Error1
type: Error6
type: Thing
type: BFO_0000002
type: Error4
type: Error5
type: BFO_0000001
type: BFO_0000031
type: IAO_0000030
type: Error3
type: Error2
type: Document

Target set selection with maximum activation time
type: Thing
type: Error2
type: BFO_0000031
type: Error1
type: Error4
type: Error3
type: IAO_0000030
type: Error6
type: Error5
type: Document
type: BFO_0000002
type: BFO_0000001

New bounds for the b-chromatic number of vertex deleted graphs
type: Document
type: BFO_0000031
type: Error2
type: BFO_0000001
type: IAO_0000030
type: Error1
type: Thing
type: Error4
type: Error6
type: Error3
type: Error5
type: BFO_0000002

Connected greedy coloring of H -free graphs
type: Document
type: Error5
type: Error2
type: Thing
type: IAO_0000030
type: Error4
type: Error1
type: BFO_0000002
type: BFO_0000031
type: Error6
type: BFO_0000001
type: Error3

Maximum cuts in edge-colored graphs
type: Document
type: IAO_0000030
type: Thing
type: Error2
type: Error1
type: BFO_0000002
type: BFO_0000001
type: BFO_0000031
type: Error4
type: Error6
type: Error3
type: Error5

Integral cographs
type: Thing
type: IAO_0000030
type: Error1
type: Error6
type: BFO_0000001
type: BFO_0000031
type: Document
type: Error5
type: Error4
type: Error2
type: BFO_0000002
type: Error3

MATEMATICA / PROBABILIDADE E ESTATISTICA
type: Concept
type: Thing

Precedence thinness in graphs
type: Thing
type: Error2
type: BFO_0000031
type: Error4
type: Error5
type: IAO_0000030
type: Document
type: BFO_0000001
type: Error6
type: Error1
type: BFO_0000002
type: Error3

Domination and convexity problems in the target set selection model
type: BFO_0000001
type: Error2
type: BFO_0000002
type: Error3
type: Thing
type: IAO_0000030
type: Error4
type: Error5
type: BFO_0000031
type: Error6
type: Document
type: Error1

Matrices inducing generalized metric on sequences
type: Thing
type: Document
type: BFO_0000031
type: Error1
type: Error2
type: Error3
type: BFO_0000001
type: Error5
type: Error4
type: BFO_0000002
type: Error6
type: IAO_0000030

Null decomposition of unicyclic graphs
type: BFO_0000002
type: Error1
type: Error2
type: IAO_0000030
type: Document
type: BFO_0000031
type: Error5
type: Thing
type: Error6
type: Error3
type: Error4
type: BFO_0000001

INTERDISCIPLINAR
type: Concept
type: Thing

Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
type: BFO_0000031
type: BFO_0000002
type: Thing
type: BFO_0000001
type: Error6
type: Error5
type: Error4
type: IAO_0000030
type: Error3
type: Error2
type: Document
type: Error1

On the Nash number and the diminishing Grundy number of a graph
type: Error2
type: Error3
type: BFO_0000001
type: Error4
type: BFO_0000002
type: Thing
type: IAO_0000030
type: Error5
type: Error6
type: BFO_0000031
type: Document
type: Error1

Revising Johnson?s table for the 21st century
type: Error3
type: Error2
type: Error1
type: IAO_0000030
type: Error6
type: BFO_0000002
type: Error5
type: Thing
type: Document
type: BFO_0000001
type: BFO_0000031
type: Error4

The Overfull Conjecture on split-comparability and split-interval graphs
type: Error6
type: BFO_0000031
type: BFO_0000001
type: Document
type: Error1
type: Thing
type: BFO_0000002
type: Error2
type: Error3
type: Error5
type: IAO_0000030
type: Error4

Strong intractability results for generalized convex recoloring problems
type: IAO_0000030
type: Error1
type: Error6
type: Thing
type: BFO_0000031
type: BFO_0000001
type: Error2
type: Error3
type: Document
type: BFO_0000002
type: Error4
type: Error5

Decomposing split graphs into locally irregular graphs
type: Error6
type: Error5
type: Thing
type: Error4
type: Document
type: BFO_0000002
type: Error3
type: BFO_0000001
type: Error2
type: IAO_0000030
type: Error1
type: BFO_0000031

Global defensive alliances in the lexicographic product of paths and cycles
type: Error1
type: Error2
type: IAO_0000030
type: Error5
type: Document
type: BFO_0000001
type: Error3
type: Error6
type: BFO_0000002
type: Error4
type: BFO_0000031
type: Thing

Group parking permit problems
type: Error2
type: Thing
type: BFO_0000031
type: IAO_0000030
type: Document
type: Error3
type: Error5
type: BFO_0000001
type: Error4
type: Error6
type: BFO_0000002
type: Error1

ECONOMIA
type: Concept
type: Thing

On gap-labellings of some families of graphs
type: IAO_0000030
type: BFO_0000002
type: Thing
type: BFO_0000001
type: Error4
type: Error6
type: BFO_0000031
type: Error3
type: Error5
type: Document
type: Error2
type: Error1

Complexity aspects of - -chord convexities
type: Document
type: Error1
type: BFO_0000001
type: Error4
type: Error3
type: Error6
type: BFO_0000031
type: Error5
type: Thing
type: IAO_0000030
type: Error2
type: BFO_0000002

Characterizations, probe and sandwich problems on ( k , - ) -cographs
type: Error6
type: Error5
type: Error4
type: Thing
type: Error3
type: Error2
type: Error1
type: IAO_0000030
type: BFO_0000002
type: BFO_0000001
type: BFO_0000031
type: Document

Non-inclusion and other subclasses of chordal graphs
type: Error2
type: Error1
type: Error4
type: BFO_0000031
type: Error3
type: Document
type: Error6
type: IAO_0000030
type: BFO_0000002
type: Error5
type: BFO_0000001
type: Thing

CIENCIA DA COMPUTACAO
type: Concept
type: Thing

Partitioning P 4 -tidy graphs into a stable set and a forest
type: Error6
type: Error1
type: Document
type: BFO_0000002
type: Error5
type: Error4
type: Thing
type: BFO_0000001
type: BFO_0000031
type: Error3
type: Error2
type: IAO_0000030

Edge clique partition in ( k , - ) -graphs
type: Error4
type: IAO_0000030
type: Error1
type: Error2
type: Thing
type: Document
type: BFO_0000001
type: Error5
type: BFO_0000002
type: Error6
type: Error3
type: BFO_0000031

Total tessellation cover: bounds, hardness, and applications
type: Error6
type: Error4
type: BFO_0000001
type: IAO_0000030
type: Error1
type: BFO_0000031
type: BFO_0000002
type: Error2
type: Error5
type: Thing
type: Error3
type: Document

Results about the total chromatic number and the conformability of some families of circulant graphs
type: Error6
type: Error5
type: BFO_0000031
type: Thing
type: IAO_0000030
type: Error2
type: BFO_0000002
type: Error1
type: BFO_0000001
type: Error4
type: Error3
type: Document

Thinness of product graphs
type: Error3
type: Error4
type: BFO_0000031
type: Thing
type: BFO_0000001
type: IAO_0000030
type: Error5
type: BFO_0000002
type: Error6
type: Document
type: Error1
type: Error2