A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Degree constrained orientations in countable graphs.”
A note on odd cycle-complete graph Ramsey numbers.
Locally graphs.
Buset, Dominique (1995)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rank numbers for bent ladders
Peter Richter, Emily Leven, Anh Tran, Bryan Ek, Jobby Jacob, Darren A. Narayan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others...
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.
Erdős, Péter L., Miklós, István, Toroczkai, Zoltán (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The -stability number of a random graph.
Fountoulakis, Nikolaos, Kang, Ross J., McDiarmid, Colin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On linear layouts of graphs.
Dujmović, Vida, Wood, David R. (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Graph compositions. I: Basic enumeration.
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
Track layouts of graphs.
Dujmović, Vida, Pór, Attila, Wood, David R. (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Random directed trees and forest -- drainage networks with dependence.
Athreya, Siva R., Roy, Rahul, Sarkar, Anish (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The perfection and recognition of bull-reducible Berge graphs
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce Reed (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The recently announced Strong Perfect Graph Theorem states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices and five edges . A graph is bull-reducible if no vertex is in two bulls. In this paper we give a simple proof that every bull-reducible Berge graph is perfect. Although this result follows...