The following pages link to Celina M. Herrera de Figueiredo (Q1567274):
Displayed 50 items.
- (Q169286) (redirect page) (← links)
- (Q221683) (redirect page) (← links)
- On the total coloring of generalized Petersen graphs (Q271609) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- Total-chromatic number and chromatic index of dually chordal graphs (Q294687) (← links)
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- The cost of perfection for matchings in graphs (Q299061) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Split clique graph complexity (Q393107) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- On the terminal connection problem (Q831820) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Note on the homogeneous set sandwich problem (Q834997) (← links)
- The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
- Algorithms for the homogeneous set sandwich problem (Q850795) (← links)
- Tree loop graphs (Q876466) (← links)
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Kinetic hanger (Q1029070) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
- Path parity and perfection (Q1356748) (← links)
- (Q1368666) (redirect page) (← links)
- Sources and sinks in comparability graphs (Q1368667) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- The stable marriage problem with restricted pairs. (Q1426462) (← links)
- A class of \(\beta\)-perfect graphs (Q1567275) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Sandwich and probe problems for excluding paths (Q1627855) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- On the embedding of cone graphs in the line with distinct distances between neighbors (Q1728106) (← links)
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)