An anti-Ramsey theorem on cycles (Q2573806)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	An anti-Ramsey theorem on cycles	scientific article

Statements

scholarly article

0 references

An anti-Ramsey theorem on cycles (English)

0 references

Juan José Montellano-Ballesteros

0 references

Víctor Neumann-Lara

0 references

Graphs and Combinatorics

0 references

publication date

24 November 2005

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00373-005-0619-y

0 references

On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems

0 references

On the minimum size of tight hypergraphs

0 references

Hamiltonian path graphs

0 references

Path connected graphs

0 references

On the hamiltonian path graph of a graph

0 references

Minimal colorings for properly colored subgraphs

0 references

An anti-Ramsey theorem

0 references

A linear heterochromatic number of graphs

0 references

On restricted colourings of \(K_ n\)

0 references

Smallest 3-graphs having a 3-colored edge in every k-coloring

0 references

Panconnected graphs. II

0 references

Sufficient Conditions for Circuits in Graphs<sup>†</sup>

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00373-005-0619-y

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2573806

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2573806&oldid=34463742"