Discrete applied mathematics combinatorial algorithms operations research and computer science
-
- Visão geral
-
- Metrics
-
- Identidade
-
- Ver todos
-
Visão geral
Qualis
código do país
tipo
publicação venue de
-
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals.
333:71-81.
2023-01-01
-
Bounding the sum of the largest signless Laplacian eigenvalues of a graph.
340:315-326.
2023-01-01
-
Domination and convexity problems in the target set selection model.
330:14-23.
2023-01-01
-
Exploring symmetries in cographs: Obtaining spectra and energies.
325:120-133.
2023-01-01
-
Graphs with many edge-colorings such that complete graphs are rainbow.
333:151-164.
2023-01-01
-
Graphs without gap-vertex-labellings: Families and bounds.
339:317-335.
2023-01-01
-
Matrices inducing generalized metric on sequences.
332:135-154.
2023-01-01
-
Models and algorithms for the Weighted Safe Set Problem.
329:23-34.
2023-01-01
-
On gap-labellings of some families of graphs.
340:296-314.
2023-01-01
-
On the complexity of the Cable-Trench Problem.
340:272-285.
2023-01-01
-
On the generalized Helly property of hypergraphs, cliques, and bicliques.
330:56-77.
2023-01-01
-
Partitioning -tidy graphs into a stable set and a forest.
338:22-29.
2023-01-01
-
Path eccentricity of graphs.
337:1-13.
2023-01-01
-
Results about the total chromatic number and the conformability of some families of circulant graphs.
340:123-133.
2023-01-01
-
Target set selection with maximum activation time.
338:199-217.
2023-01-01
-
The Overfull Conjecture on split-comparability and split-interval graphs.
340:228-238.
2023-01-01
-
-convexity on graphs with diameter two: Computing hull and interval numbers.
321:368-378.
2022-01-01
-
Anti-Ramsey threshold of cycles.
323:228-235.
2022-01-01
-
Backbone coloring of graphs with galaxy backbones.
323:2-13.
2022-01-01
-
Biclique graphs of split graphs.
online:In press.
2022-01-01
-
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs.
323:124-133.
2022-01-01
-
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs.
307:50-61.
2022-01-01
-
Computing the zig-zag number of directed graphs.
312:86-105.
2022-01-01
-
Edge clique partition in -graphs.
306:89-97.
2022-01-01
-
Hull and geodetic numbers for some classes of oriented graphs.
323:14-27.
2022-01-01
-
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension.
308:4-19.
2022-01-01
-
Interactive unawareness in the graph model for multilateral conflicts.
318:31-46.
2022-01-01
-
Leafy spanning arborescences in DAGs.
323:217-227.
2022-01-01
-
Minimum 2-dominating sets in regular graphs.
323:268-285.
2022-01-01
-
New bounds for the b-chromatic number of vertex deleted graphs.
306:108-113.
2022-01-01
-
On subclasses of interval count two and on Fishburn’s conjecture.
1:1-251.
2022-01-01
-
On the Nash number and the diminishing Grundy number of a graph.
314:1-16.
2022-01-01
-
On the structure of the inverse of non-singular unicyclic graphs.
321:316-332.
2022-01-01
-
Positive semidefiniteness of on some f.
323:113-123.
2022-01-01
-
A compact quadratic model and linearizations for the minimum linear arrangement problem.
323:134-148.
2021-01-01
-
An integer programming approach for solving a generalized version of the Grundy domination number.
301:26-48.
2021-01-01
-
Compositions, decompositions, and conformability for total coloring on power of cycle graphs.
1:1-363.
2021-01-01
-
Decomposing split graphs into locally irregular graphs.
292:33-44.
2021-01-01
-
Hardness and efficiency on -admissibility for graph operations.
304:342-348.
2021-01-01
-
On the -interval and the -convexity numbers of graphs and graph products.
319:487-498.
2021-01-01
-
Percolation centrality via Rademacher Complexity.
-:--216.
2021-01-01
-
Precedence thinness in graphs.
1:1-20.
2021-01-01
-
Rainbow connectivity and rainbow criticality on graph classes.
323:311-323.
2021-01-01
-
Revising Johnson?s table for the 21st century.
-:--17.
2021-01-01
-
The biclique partitioning polytope.
301:118-130.
2021-01-01
-
Thinness of product graphs.
312:52-71.
2021-01-01
-
Total tessellation cover: bounds, hardness, and applications.
1:1-15.
2021-01-01
-
Unit form recognition by mutations: Application of mutations in the search of positive roots.
291:223-236.
2021-01-01
-
Biclique graphs of interval bigraphs.
281:134-143.
2020-01-01
-
Characterizations, probe and sandwich problems on -cographs.
1:1-133.
2020-01-01
-
Complexity aspects of -chord convexities.
284:585-591.
2020-01-01
-
Complexity-separating graph classes for vertex, edge and total colouring.
281:162-171.
2020-01-01
-
Connected greedy coloring of -free graphs.
284:572-584.
2020-01-01
-
Constant threshold intersection graphs of orthodox paths in trees.
281:61-68.
2020-01-01
-
Determining equitable total chromatic number for infinite classes of complete -partite graphs.
296:56-67.
2020-01-01
-
Edge-colouring graphs with bounded local degree sums.
281:268-283.
2020-01-01
-
Global defensive alliances in the lexicographic product of paths and cycles.
283:168-188.
2020-01-01
-
Group parking permit problems.
1:1-194.
2020-01-01
-
Integral cographs.
283:153-167.
2020-01-01
-
Intersection graph of maximal stars.
285:567-580.
2020-01-01
-
Intersection of longest paths in graph classes.
281:96-105.
2020-01-01
-
Maximum cuts in edge-colored graphs.
281:229-234.
2020-01-01
-
Non-inclusion and other subclasses of chordal graphs.
272:43-47.
2020-01-01
-
Null decomposition of unicyclic graphs.
285:594-611.
2020-01-01
-
On hyper-Hamiltonicity in graphs.
281:195-202.
2020-01-01
-
On the computational complexity of closest genome problems.
274:26-34.
2020-01-01
-
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem.
289:503-515.
2020-01-01
-
Short proofs on the structure of general partition, equistable and triangle graphs.
303:3-13.
2020-01-01
-
Strong intractability results for generalized convex recoloring problems.
281:252-260.
2020-01-01
-
The Solitaire Clobber game and correducibility of graphs.
281:144-150.
2020-01-01
tem uma área de assunto
publisher
is open access
-
False
invalid format
is in DOAJ
-
False
invalid format
Metrics
2 year mean citedness
H index
i10 index
Identidade
ISSN-L
openalex identifier
-
https://openalex.org/S171741597
International Standard Serial Number (ISSN)