Premium
Disjoint directed quadrilaterals in a directed graph
Author(s) -
Zhang Danhong,
Wang Hong
Publication year - 2005
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20096
Subject(s) - combinatorics , quadrilateral , mathematics , disjoint sets , graph , directed graph , discrete mathematics , integer (computer science) , computer science , physics , finite element method , thermodynamics , programming language
Let D be a directed graph of order 4 k , where k is a positive integer. Suppose that the minimum degree of D is at least 6 k − 2. We show that D contains k disjoint directed quadrilaterals with only one exception. © 2005 Wiley Periodicals, Inc. J Graph Theory
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom