Long heterochromatic paths in heterochromatic triangle free graphs

@inproceedings{Chen2008LongHP,
  title={Long heterochromatic paths in heterochromatic triangle free graphs},
  author={He Chen and Xueliang Li},
  year={2008}
}
AbstractIn this paper, graphs under consideration are always edge-colored. Weconsiderlongheterochromaticpathsinheterochromatictrianglefreegraphs.Two kinds of such graphs are considered, one is complete graphs with Gal-lai colorings, i.e., heterochromatic triangle free complete graphs; the otheris heterochromatic triangle free graphs with k-good colorings, i.e., mini-mum color degree at least k. For the heterochromatic triangle free graphsK n , we obtain that for every vertex v ∈ V(K n ), K n… CONTINUE READING

Similar Papers

Figures from this paper.

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

T

M. Axenovich
  • Jiang and Zs. Tuza, Local anti-Ramsey numbers of graphs, Combin. Probab. Comput. 12
  • 2003
VIEW 2 EXCERPTS

Paths and cycles in colored graphs

  • Australasian J. Combinatorics
  • 2001
VIEW 1 EXCERPT

M

Y. Manoussakis
  • Spyratos and Zs. Tuza, Cycles of given color patterns, J. Graph Theory 21
  • 1996
VIEW 1 EXCERPT

Zs

Y. Manoussakis, M. Spyratos
  • Tuza and M. Voigt, Minimal colorings for properly colored subgraphs, Graphs and Combin. 12
  • 1996
VIEW 1 EXCERPT

M

W. S. Chou, Y. Manoussakis, O. Megalaki
  • Spyratos and Zs. Tuza, Paths through fixed vertices in edge-colored graphs, Math. Inf. Sci. Hun. 32
  • 1994

Polychromatic Hamilton cycles

  • Discrete Mathematics
  • 1993
VIEW 2 EXCERPTS