R. C. S. Machado

Available identifiers

zbMath Open machado.raphael-carlos-santosMaRDI QIDQ987681

List of research outcomes

Publication	Date of Publication	Type
On the chromatic index of complementary prisms	2024-10-18	Paper
The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark	2024-06-05	Paper
An optimal algorithm to totally color some powers of cycle graphs	2024-04-25	Paper
Compositions, decompositions, and conformability for total coloring on power of cycle graphs	2022-11-02	Paper
Even-power of cycles with many vertices are type 1 total colorable	2022-04-27	Paper
On the embedding of cone graphs in the line with distinct distances between neighbors	2019-02-21	Paper
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets	2018-05-24	Paper
Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs	2017-04-12	Paper
On star and biclique edge-colorings	2017-03-16	Paper
Linear-time graph distance and diameter approximation	2016-10-21	Paper
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions	2016-10-17	Paper
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3	2016-02-18	Paper
On the recognition of unit disk graphs and the distance geometry problem with ranges	2015-09-30	Paper
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs	2015-09-22	Paper
Biclique-colouring verification complexity and biclique-colouring power graphs	2015-08-18	Paper
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3	2014-03-31	Paper
Edge-colouring and total-colouring chordless graphs	2014-01-20	Paper
Towards a provably resilient scheme for graph-based watermarking	2013-12-06	Paper
Complements of nearly perfect graphs	2013-11-05	Paper
Linear time approximation for dominating sets and independent dominating sets in unit disk graphs	2013-09-13	Paper
Complexity separating classes for edge-colouring and total-colouring	2013-08-06	Paper
A tight bound for exhaustive key search attacks against message authentication codes	2013-06-18	Paper
Clique-colouring and biclique-colouring unichord-free graphs	2012-06-29	Paper
Total chromatic number of \{square,unichord\}-free graphs	2012-05-13	Paper
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges	2012-05-13	Paper
Total chromatic number of unichord-free graphs	2011-10-27	Paper
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs	2011-06-22	Paper
Complexity dichotomy on partial grid recognition	2011-05-10	Paper
Decompositions for edge-coloring join graphs and cobipartite graphs	2010-08-13	Paper
Chromatic index of graphs with no cycle with a unique chord	2010-03-09	Paper
Sufficient conditions for a graph to be edge-colorable with maximum degree colors	2008-06-05	Paper

Research outcomes over time

This page was built for person: R. C. S. Machado