Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Total weight choosability of graphs.”
Anti-Ramsey numbers of spanning double stars.
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hosoya polynomial of Hanoi graphs
Kishori P. Narayankar, S. B. Lokesh, Veena Mathad, Ivan Gutman (2012)
Kragujevac Journal of Mathematics
Similarity:
Toughness of -minor-free graphs.
Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of spanning trees of double graphs
Liu Wu-xin, Wei Fu-yi (2011)
Kragujevac Journal of Mathematics
Similarity:
Derived graphs of some graphs
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
Orthogonal vector coloring.
Haynes, Gerald, Park, Catherine, Schaeffer, Amanda, Webster, Jordan, Mitchell, Lon H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sharp bounds for the sum of the squares of the degrees of a graph
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Expected lengths of minimum spanning trees for non-identical edge distributions.
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Extremal graph theory for metric dimension and diameter.
Hernando, Carmen, Mora, Mercè, Pelayo, Ignacio M., Seara, Carlos, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: