### A note on embedding hypertrees.

Loh, Po-Shen (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Loh, Po-Shen (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Alexander Halperin, Colton Magnant, Kyle Pula (2014)

Discussiones Mathematicae Graph Theory

Similarity:

An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. We then use this structure to prove Ramsey-type results within Gallai colorings. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decomposition into directed...

Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)

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,...

Bohdan Zelinka (1983)

Časopis pro pěstování matematiky

Similarity:

Caro, Yair, Yuster, Raphael (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Kostochka, Alexandr V., Stiebitz, Michael (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)

Mathématiques et Sciences Humaines

Similarity:

We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...

Henning, Michael A., Yeo, Anders (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity: