The following pages link to Raphael C. S. Machado (Q987681):
Displayed 29 items.
- Item:Q987681 (redirect page) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Complements of nearly perfect graphs (Q376556) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- Item:Q987681 (redirect page) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- On the embedding of cone graphs in the line with distinct distances between neighbors (Q1728106) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- Linear-time graph distance and diameter approximation (Q2827756) (← links)
- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs (Q2848916) (← links)
- Towards a Provably Resilient Scheme for Graph-Based Watermarking (Q2864290) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
- Clique-Colouring and Biclique-Colouring Unichord-Free Graphs (Q2894495) (← links)
- On star and biclique edge-colorings (Q2968507) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- Sufficient conditions for a graph to be edge-colorable with maximum degree colors (Q3503532) (← links)
- A tight bound for exhaustive key search attacks against Message Authentication Codes (Q4928766) (← links)