Displaying similar documents to “On maps: Continuous, closed, perfect, and with closed graph.”

Conditions for β-perfectness

Judith Keijsper, Meike Tewes (2002)

Discussiones Mathematicae Graph Theory

Similarity:

A β-perfect graph is a simple graph G such that χ(G') = β(G') for every induced subgraph G' of G, where χ(G') is the chromatic number of G', and β(G') is defined as the maximum over all induced subgraphs H of G' of the minimum vertex degree in H plus 1 (i.e., δ(H)+1). The vertices of a β-perfect graph G can be coloured with χ(G) colours in polynomial time (greedily). The main purpose of this paper is to give necessary and sufficient conditions, in terms of forbidden...

Spaces of ω-limit sets of graph maps

Jie-Hua Mai, Song Shao (2007)

Fundamenta Mathematicae

Similarity:

Let (X,f) be a dynamical system. In general the set of all ω-limit sets of f is not closed in the hyperspace of closed subsets of X. In this paper we study the case when X is a graph, and show that the family of ω-limit sets of a graph map is closed with respect to the Hausdorff metric.

A note on pm-compact bipartite graphs

Jinfeng Liu, Xiumei Wang (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered