The following pages link to Simone Dantas (Q266966):
Displayed 50 items.
- Averaging 2-rainbow domination and Roman domination (Q266967) (← links)
- On the total coloring of generalized Petersen graphs (Q271609) (← links)
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- Slash and burn on graphs -- firefighting with general weights (Q299037) (← links)
- Item:Q266966 (redirect page) (← links)
- The 1,2-conjecture for powers of cycles (Q324730) (← links)
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs (Q494436) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- The total-chromatic number of some families of snarks (Q536223) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- The chain graph sandwich problem (Q646705) (← 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)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- A note on a penalty function approach for solving bilevel linear programs (Q1580432) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- On the maximum number of minimum dominating sets in forests (Q1727765) (← links)
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- Stable skew partition problem (Q1887035) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- Solitaire Clobber on circulant graphs (Q2017045) (← links)
- Relating hypergraph parameters of generalized power graphs (Q2056895) (← links)
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- A general method for forbidden induced subgraph sandwich problem NP-completeness (Q2132372) (← links)
- On caterpillars of game chromatic number 4 (Q2132381) (← links)
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even (Q2132407) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- The solitaire clobber game and correducibility of graphs (Q2184676) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Solitaire clobber played on Cartesian product of graphs (Q2255046) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Asymptotic surviving rate of trees with multiple fire sources (Q2341747) (← links)
- Perfectly relating the domination, total domination, and paired domination numbers of a graph (Q2342631) (← links)
- Relating 2-rainbow domination to Roman domination (Q2409786) (← links)
- The solitaire clobber game and correducibility (Q2413160) (← links)
- On type 2 snarks and dot products (Q2413173) (← links)
- Equitable total coloring of complete $r$-partite $p$-balanced graphs (Q2414460) (← links)
- Timber game as a counting problem (Q2414465) (← links)
- Extended skew partition problem (Q2433705) (← links)
- More fires and more fighters (Q2444533) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- Dominating sets inducing large components (Q2629281) (← links)
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs (Q2663994) (← links)