scientific article

zbMath0528.05034MaRDI QIDQ3309863

No author found.

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stable setinduced subgraphssymmetric digraphsmaximum length of a path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (20)

Graphs with not all possible path-kernels ⋮ Extended path partition conjecture for semicomplete and acyclic compositions ⋮ Independent sets which meet all longest paths ⋮ The path partition conjecture is true for claw-free graphs ⋮ Computational results on the traceability of oriented graphs of small order ⋮ A linear bound towards the traceability conjecture ⋮ Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ Some remarks on the structure of strong \(k\)-transitive digraphs ⋮ Some results on 4-transitive digraphs ⋮ A note on a cycle partition problem ⋮ Traceability of \(k\)-traceable oriented graphs ⋮ Stable set meeting every longest path ⋮ Longest path partitions in generalizations of tournaments ⋮ On a cycle partition problem ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ On a tree-partition problem

This page was built for publication: