<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>

COPY SCRIPT

For further information contact us at helpdesk@openaire.eu

Pancyclic orderings of in-tournaments

Name: Pancyclic orderings of in-tournaments
Creator: Meike Tewes
Keywords: Extremal problems in graph theory, bound, Applied Mathematics, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 0101 mathematics, Paths and cycles, 01 natural sciences, digraph

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1999Publisher:Elsevier BVJournal:Discrete Applied Mathematics, volume 120, pages 239-249 (issn: 0166-218X,

Authors: Meike Tewes;

doi: 10.1016/s0166-218x(01)00293-1 , 10.1016/s1571-0653(05)00765-1 , 10.1016/s1571-0653(05)80053-8

Pancyclic orderings of in-tournaments

- Summary
- Subjects
- Related research
  (6)
- Metrics

Abstract

Let \(D\) denote a strong in-tournament with \(n\geq 3\) vertices, such that each vertex has at least \((3n- 3)/8\) arcs directed towards it. The author shows, among other things, that there is an ordering of the vertices such that the digraph determined by the first \(t\) vertices in this ordering is Hamiltonian, for \(t= 3,4,\dots,n\). The lower bound is sharp.

Related Organizations

Freiberg University of Mining and Technology
Germany
TU Bergakademie Freiberg
Germany

Keywords

Extremal problems in graph theory, bound, Applied Mathematics, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, Paths and cycles, digraph, Hamiltonian

6 Research products, page 1 of 1

Pancyclic in-tournaments
2001IsAmongTopNSimilarDocuments
Completing orientations of partially oriented graphs
2017IsAmongTopNSimilarDocuments
Local tournaments and in-tournaments
2007IsAmongTopNSimilarDocuments
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
1993IsAmongTopNSimilarDocuments
On the Complexity of Singly Connected Vertex Deletion
2020IsAmongTopNSimilarDocuments
Vertex 6-pancyclic in-tournaments
2004IsAmongTopNSimilarDocuments

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average