Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2761044
Jump to:navigation, search

zbMath0977.05057MaRDI QIDQ2761044

William F. Klostermeyer

Publication date: 17 December 2001


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

zbMATH Keywords

connectivitydigraphstournamentspushing a vertexreverse orientation


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)


Related Items (11)

Pushing vertices in digraphs without long induced cycles ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ On oriented cliques with respect to push operation ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ On the pushable chromatic number of various types of grids ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Acyclically pushable bipartite permutation digraphs: an algorithm ⋮ An Ore-type condition for cyclability ⋮ Density decompositions of networks ⋮ Neighborhood unions and cyclability of graphs ⋮ A fan-type condition for cyclability







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2761044&oldid=15636587"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki