Quasi-hamiltonian paths in semicomplete multipartite digraphs

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Discrete Applied Mathematics

• Publication date

  2013-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.dam.2012.12.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Inference

  2020cited by this paper
• Weakly quasi-Hamiltonian-set-connected multipartite tournaments

  2012cited by this paper
• Digraphs - Theory, Algorithms and Applications, Second Edition

  2009cited by this paper
• Computing Slater Rankings Using Similarities among Candidates

  2006cited by this paper
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

  2006cited by this paper
• Digraphs - theory, algorithms and applications

  2002cited by this paper
• Spanning multipartite tournaments of semicomplete multipartite digraphs

  2001cited by this paper
• Vertex deletion and cycles in multipartite tournaments

  1999cited by this paper
• Generalizations of tournaments: A survey

  1998cited by this paper
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

  1998cited by this paper
• One-diregular subgraphs in semicomplete multipartite digraphs

  1997cited by this paper
• Weakly Hamiltonian-connected ordinary multipartite tournaments

  1995cited by this paper
• Finding a Longest Path in a Complete Multipartite Digraph

  1993cited by this paper
• A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs

  1992cited by this paper
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

  1992cited by this paper
• On Feedback Problems in Diagraphs

  1989cited by this paper
• Hamiltonian-connected tournaments

  1980cited by this paper
• Color Coding

  1962cited by this paper

• Quasi <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e45" altimg="si14.svg"> <mml:msub> <mml:mrow/> <mml:mrow> <mml:mi mathvariant="normal">nl</mml:mi>

  2026cites this paper
• The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs

  2025influential citation
• Quasips\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Quasi _{\textrm{ps}}$$\end{document}-Pancyclicity of Regular Mu

  2023cites this paper
• Tournaments and Semicomplete Digraphs

  2018cites this paper
• Semicomplete Multipartite Digraphs

  2018cites this paper