The following pages link to Vinícius Fernandes dos Santos (Q591806):
Displaying 50 items.
- (Q271607) (redirect page) (← links)
- On the total coloring of generalized Petersen graphs (Q271609) (← links)
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- (Q442342) (redirect page) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- (Q1701088) (redirect page) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- One-sided weak dominance drawing (Q1711831) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Structural parameterizations for equitable coloring (Q2081609) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Intersection graph of maximal stars (Q2197473) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
- On the geodetic rank of a graph (Q2364865) (← links)
- On subbetweennesses of trees: hardness, algorithms, and characterizations (Q2429121) (← links)
- Irreversible conversion processes with deadlines (Q2447539) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- On the Radon Number for P 3-Convexity (Q2894471) (← links)
- (Q2928582) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- (Q4982366) (← links)
- (Q5089236) (← links)
- (Q5377224) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- Polynomial time algorithms for the token swapping problem on cographs (Q6127637) (← links)
- Total coloring of snarks is NP-complete (Q6489441) (← links)
- The \(k\)-in-a-tree problem for chordal graphs (Q6489445) (← links)
- Short block-move-CPP is \textsf{NP}-complete (Q6489485) (← links)
- Computational complexity and linear formulations for optimizing the location of shared mobility stations (Q6495374) (← links)
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)
- Exact algorithms for biclique coloring (Q6496788) (← links)
- Equitable partition of graphs into independent sets and cliques (Q6496798) (← links)
- Reducing the vertex cover number via edge contractions (Q6584073) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
- On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)
- Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs (Q6755341) (← links)
