Edge and total choosability of near-outerplanar graphs.
Hetherington, Timothy J., Woodall, Douglas R. (2006)
The Electronic Journal of Combinatorics [electronic only]
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.
Displaying similar documents to “Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.”
Edge and total choosability of near-outerplanar graphs.
The Turán density of the hypergraph .
Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total domination and matching numbers in claw-free graphs.
Henning, Michael A., Yeo, Anders (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Defective choosability of graphs without small minors.
Wood, Rupert G., Woodall, Douglas R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on two multicolor Ramsey numbers.
Engström, Alexander (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow matching in edge-colored graphs.
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multigraphs (only) satisfy a weak triangle removal lemma.
Shapira, Asaf, Yuster, Raphael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on edge-colourings avoiding rainbow and monochromatic .
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Partitions and edge colourings of multigraphs.
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Small stretch spanners on dynamic graphs.
Ausiello, Giorgio, Franciosa, Paolo G., Italiano, Giuseppe F. (2006)
Journal of Graph Algorithms and Applications
Similarity:
A note on embedding hypertrees.
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A decomposition of gallai multigraphs
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...