Displaying similar documents to “The niche graphs of interval orders”

The Phylogeny Graphs of Doubly Partial Orders

Boram Park, Yoshio Sano (2013)

Discussiones Mathematicae Graph Theory

Similarity:

The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph P(D) of a digraph D is the (simple undirected) graph defined by V (P(D)) := V (D) and E(P(D)) := {xy | N+D (x) ∩ N+D(y) ¹ ⊘ } ⋃ {xy | (x,y)...

Supermagic Graphs Having a Saturated Vertex

Jaroslav Ivančo, Tatiana Polláková (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.