Quasi-Transitive Digraphs and Their Extensions (Q3120440)

From MaRDI portal

Revision as of 11:25, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Quasi-Transitive Digraphs and Their Extensions	scientific article

Statements

scholarly article

0 references

Quasi-Transitive Digraphs and Their Extensions (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-71840-8_8

0 references

Hortensia Galeana-Sánchez

0 references

César Hernández-Cruz

0 references

Springer Monographs in Mathematics

0 references

publication date

4 March 2019

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-71840-8_8

0 references

0 references

\(k\)-quasi-transitive digraphs of large diameter

0 references

The Path Partition Conjecture is true for some generalizations of tournaments

0 references

Digraphs with the path‐merging property

0 references

Edge-disjoint in- and out-branchings in tournaments and related path problems

0 references

Linkages in locally semicomplete digraphs and quasi-transitive digraphs

0 references

The structure of strong arc-locally semicomplete digraphs

0 references

Disjoint Paths in Decomposable Digraphs

0 references

0 references

0 references

Generalizations of tournaments: A survey

0 references

On the complexity of hamiltonian path and cycle problems in certain classes of digraphs

0 references

Paths and cycles in extended and decomposable digraphs

0 references

Vertex heaviest paths and cycles in quasi-transitive digraphs

0 references

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

0 references

Kings in quasi-transitive digraphs

0 references

Quasi‐transitive digraphs

0 references

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

0 references

Arc-Disjoint Paths in Decomposable Digraphs

0 references

Longest path partitions in generalizations of tournaments

0 references

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

0 references

Expressive power of digraph solvability

0 references

Robbins's Theorem for Mixed Multigraphs

0 references

0 references

Perfect graphs, kernels, and cores of cooperative games

0 references

Distances in orientations of graphs

0 references

Colourings, homomorphisms, and partitions of transitive digraphs

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

The directed subgraph homeomorphism problem

0 references

Edge-disjoint paths in digraphs with bounded independence number

0 references

Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete

0 references

The directed path partition conjecture

0 references

On the structure of strong 3-quasi-transitive digraphs

0 references

Independent sets and non-augmentable paths in generalizations of tournaments

0 references

k-kernels in generalizations of transitive digraphs

0 references

On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs

0 references

Some results on 4-transitive digraphs

0 references

0 references

Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs

0 references

0 references

On the number of quasi-kernels in digraphs

0 references

Orientations of digraphs almost preserving diameter

0 references

Disjoint quasi-kernels in digraphs

0 references

On the complexity of the 3-kernel problem in some classes of digraphs

0 references

3-transitive digraphs

0 references

4-transitive digraphs I: the structure of strong 4-transitive digraphs

0 references

\(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs

0 references

Some remarks on the structure of strong \(k\)-transitive digraphs

0 references

Number of 4-kings in bipartite tournaments with no 3-kings

0 references

Combinatorial optimization. Theory and algorithms

0 references

0 references

Complexity of the directed spanning cactus problem

0 references

Hamiltonian-connected tournaments

0 references

0 references

Finding kernels or solving SAT

0 references

\((k-1)\)-kernels in strong \(k\)-transitive digraphs

0 references

<i>k</i>‐Kings in <i>k</i>‐Quasitransitive Digraphs

0 references

Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs

0 references

Hamiltonian paths in \(k\)-quasi-transitive digraphs

0 references

\((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs

0 references

Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3120440

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3120440&oldid=36476668"