4 papers
Harmonious Colorings: bounds, heuristics and integer-linear formulations
Júlio Araújo, Manoel Campêlo, Beatriz Martins +1
A proper coloring of a simple graph is harmonious if, for every pair of distinct edges , we have that . The harmonious chrom…
(Even hole, triangle)-free graphs revisited
Beatriz Martins, Nicolas Trotignon
We revisit a classical paper about (even hole, triangle)-free graphs [Conforti, Cornuéjols, Kapoor and Vu\v skoviÄ, Triangle-free graphs that are signable without even holes, Jou…
Lollipops, dense cycles and chords
ZdenÄk DvoÅák, Beatriz Martins, Stéphan Thomassé +1
In 1980, Gupta, Kahn and Robertson proved that every graph with minimum degree at least contains a cycle containing at least vertices each having at least $…
1-2 Conjectures for Graphs with Low Degeneracy Properties
Julien Bensmail, Beatriz Martins, Chaoliang Tang
In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by KaroÅski, Åuczak, and Thomason in 2004: for every connected graph different from , we can assign la…