O jednom extremálním problému pro grafy s
O minimálních grafech, obsahujících daných bodů
O perfektních a kvaziperfektních grafech
Odd and residue domination numbers of a graph
Let G = (V,E) be a simple, undirected graph. A set of vertices D is called an odd dominating set if |N[v] ∩ D| ≡ 1 (mod 2) for every vertex v ∈ V(G). The minimum cardinality of an odd dominating set is called the odd domination number of G, denoted by γ₁(G). In this paper, several algorithmic and structural results are presented on this parameter for grids, complements of powers of cycles, and other graph classes as well as for more general forms of "residue" domination.
Odd-vertex-degree trees maximizing Wiener index
On (4, 2)-digraphs containing a cycle of length 2.
On a Certain Type of Decompositions of Complete Graphs into Factors with Equal Diameters
On a class of polynomials associated with the cliques in a graph and its applications.
On a conjecture by Nash-Williams
On a maximal distance between graphs
On a minimum cycle basis of a graph
On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k. We denote by σk(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k ≥ 3 and s ≥ 0 be integers, and suppose G is a connected graph and σk(G) ≥ |V (G)|+s−1. Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree less than k. The degree...
On A System Of All Maximal Chains (Antichains) Of A Graph
On a two-sided Turán problem.
On an evaluation function for heuristic search as a path problem
On an extremal problem in graph theory
On Arbitrarily Traceable Graphs.
On arbitrarily vertex decomposable unicyclic graphs with dominating cycle
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that , there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ 1,...,k the set induces a connected subgraph of G on vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour.
On Certain Edge-Critical Graphs of a Given Diameter
On Certain Homomorphism Properties of Graphs I.