A note on embedding hypertrees.
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saenpholphat, Varaporn, Zhang, Ping (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Gyárfás, András, Ruszinkó, Miklós, Sarközy, Gábor N., Szemerédi, Endre (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yuehua Bu, Ko-Wei Lih, Weifan Wang (2011)
Discussiones Mathematicae Graph Theory
Similarity:
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu,...
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
D. De Werra (1974)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sylwia Cichacz, Jakub Przybyło (2010)
Discussiones Mathematicae Graph Theory
Similarity:
In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) - the irregular coloring number, and hence verify the conjecture when G is a vertex-disjoint union of paths. We also investigate the point-distinguishing chromatic index, χ₀(G), where sets, instead of multisets, are required to be distinct,...
Collins, Karen L., Trenk, Ann N. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: