Raphael C. S. Machado

From MaRDI portal
Person:987681

Available identifiers

zbMath Open machado.raphael-carlos-santosMaRDI QIDQ987681

List of research outcomes

PublicationDate of PublicationType
An optimal algorithm to totally color some powers of cycle graphs2024-04-25Paper
Compositions, decompositions, and conformability for total coloring on power of cycle graphs2022-11-02Paper
Even-power of cycles with many vertices are type 1 total colorable2022-04-27Paper
On the embedding of cone graphs in the line with distinct distances between neighbors2019-02-21Paper
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets2018-05-24Paper
Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs2017-04-12Paper
On star and biclique edge-colorings2017-03-16Paper
Linear-time graph distance and diameter approximation2016-10-21Paper
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions2016-10-17Paper
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 32016-02-18Paper
On the recognition of unit disk graphs and the distance geometry problem with ranges2015-09-30Paper
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs2015-09-22Paper
Biclique-colouring verification complexity and biclique-colouring power graphs2015-08-18Paper
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 32014-03-31Paper
Edge-colouring and total-colouring chordless graphs2014-01-20Paper
Towards a Provably Resilient Scheme for Graph-Based Watermarking2013-12-06Paper
Complements of nearly perfect graphs2013-11-05Paper
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs2013-09-13Paper
Complexity separating classes for edge-colouring and total-colouring2013-08-06Paper
A tight bound for exhaustive key search attacks against Message Authentication Codes2013-06-18Paper
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs2012-06-29Paper
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges2012-05-13Paper
Total chromatic number of {square,unichord}-free graphs2012-05-13Paper
Total chromatic number of unichord-free graphs2011-10-27Paper
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs2011-06-22Paper
Complexity dichotomy on partial grid recognition2011-05-10Paper
Decompositions for edge-coloring join graphs and cobipartite graphs2010-08-13Paper
Chromatic index of graphs with no cycle with a unique chord2010-03-09Paper
Sufficient conditions for a graph to be edge-colorable with maximum degree colors2008-06-05Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


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