R
Raphael C. S. Machado
Researcher at National Institute of Metrology Standardization and Industrial Quality
Publications - 88
Citations - 581
Raphael C. S. Machado is an academic researcher from National Institute of Metrology Standardization and Industrial Quality. The author has contributed to research in topics: Chordal graph & Indifference graph. The author has an hindex of 11, co-authored 83 publications receiving 467 citations. Previous affiliations of Raphael C. S. Machado include Federal University of Rio de Janeiro & Centro Federal de Educação Tecnológica de Minas Gerais.
Papers
More filters
Journal ArticleDOI
Covert Attacks in Cyber-Physical Control Systems
TL;DR: A covert attack for service degradation is proposed, which is planned based on the intelligence gathered by another attack, herein proposed, referred as system identification attack, which demonstrates that the joint operation of the two attacks is capable to affect, in a covert and accurate way, the physical behavior of a system.
Journal ArticleDOI
Chromatic index of graphs with no cycle with a unique chord
TL;DR: The class C of graphs that do not contain a cycle with a unique chord was recently studied and it is shown that it is NP-complete to determine whether the chromatic index of a graph is equal to its maximum degree when the input is restricted to regular graphs of C with fixed degree @D>=3.
Journal ArticleDOI
Edge-colouring and total-colouring chordless graphs
TL;DR: This work describes a known decomposition result for chordless graphs and uses it to establish that every chordless graph of maximum degree Δ ≥ 3 has chromatic index Δ and total chromatic number Δ + 1 and outputs an optimal colouring of a graph instance in polynomial time.
Journal ArticleDOI
Total chromatic number of unichord-free graphs
TL;DR: It is proved that the total-colouring problem is NP-complete when restricted to graphs in C and the validity of the Total Colouring Conjecture is established by proving that every non-complete {square, unichord}-free graph of maximum degree at least 4 is Type 1.
Journal ArticleDOI
Decompositions for edge-coloring join graphs and cobipartite graphs
TL;DR: This work proposes edge-decompositions of a graph G with the goal of edge-coloring G with @D(G) colors and applies these decompositions for identifying new subsets of Class 1 join graphs and cobipartite graphs.