Miscellaneous digraph classes

DOI10.1007/978-3-319-71840-8_11MaRDI QIDQ3120443zbMATH OpenOpenAlexFDO

Authors Yubao Guo, Michel Surmacs

Publication date 4 March 2019

Published in Springer Monographs in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-71840-8_11

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• A classification of arc-locally semicomplete digraphs
• Tournaments and Semicomplete Digraphs
• On the structure of locally semicomplete digraphs
• A classification of locally semicomplete digraphs
• scientific article; zbMATH DE number 1498519

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3838057 (Why is no real title available?)
• scientific article; zbMATH DE number 5178709 (Why is no real title available?)
• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 4021187 (Why is no real title available?)
• scientific article; zbMATH DE number 3675952 (Why is no real title available?)
• scientific article; zbMATH DE number 3735859 (Why is no real title available?)
• scientific article; zbMATH DE number 3771630 (Why is no real title available?)
• scientific article; zbMATH DE number 1107738 (Why is no real title available?)
• scientific article; zbMATH DE number 1161249 (Why is no real title available?)
• scientific article; zbMATH DE number 219243 (Why is no real title available?)
• scientific article; zbMATH DE number 857070 (Why is no real title available?)
• scientific article; zbMATH DE number 927077 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• scientific article; zbMATH DE number 6423664 (Why is no real title available?)
• scientific article; zbMATH DE number 3218572 (Why is no real title available?)
• scientific article; zbMATH DE number 3390805 (Why is no real title available?)
• scientific article; zbMATH DE number 3046846 (Why is no real title available?)
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• (k,l)-kernels in line digraphs
• (k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings
• A Design for Directed Graphs with Minimum Diameter
• A Linear Recognition Algorithm for Cographs
• A Simple Linear Time LexBFS Cograph Recognition Algorithm
• A bijective proof of a theorem of Knuth
• A broadcasting protocol in line digraphs
• A characterization of perfect graphs
• A classification of all arc-locally semicomplete digraphs
• A classification of arc-locally semicomplete digraphs
• A compact labelling scheme for series-parallel graphs
• A complete axiomatisation for the inclusion of series-parallel partial orders
• A conjecture on 3-anti-quasi-transitive digraphs
• A new solvable case of the traveling salesman problem
• A note on kernel-critical graphs
• A note on line digraphs and the directed max-cut problem
• A note on the number of spanning trees of line digraphs
• A survey: Hamiltonian cycles in Cayley graphs
• Adjusted interval digraphs
• An interval digraph in relation to its associated bipartite graph
• Arc colorings of digraphs
• Arc-disjoint paths in decomposable digraphs
• Asymmetric directed graph coloring games
• Automorphism groups and isomorphisms of Cayley digraphs
• Broadcasting and Gossiping in de Bruijn Networks
• Chronological orderings of interval digraphs
• Connection digraphs and second-order line digraphs
• Connectivity of Regular Directed Graphs with Small Diameters
• Connectivity of circulant digraphs
• Connectivity of consecutive-d digraphs
• Cycles and paths in bipartite tournaments with spanning configurations
• Cycles in 3-anti-circulant digraphs
• Cycles through \(k\) vertices in bipartite tournaments
• Design to Minimize Diameter on Building-Block Network
• Digraphs
• Digraphs with the path‐merging property
• Directed defective asymmetric graph coloring games
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Disproof of a conjecture about independent branchings in k‐connected directed graphs
• Edge-disjoint Hamiltonian cycles in hypertournaments
• Fully dynamic recognition algorithm and certificate for directed cographs
• Game colouring directed graphs
• Game-perfect digraphs
• HOW TO DRAW A SERIES-PARALLEL DIGRAPH
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
• Hamiltonian cycles in circulant digraphs with two stripes
• Hamiltonian paths and cycles in hypertournaments
• Independence number of iterated line digraphs
• 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
• Independent spanning trees with small depths in iterated line digraphs
• Interval Tournaments
• Interval digraphs: An analogue of interval graphs
• Isomorphism of circulant graphs and digraphs
• Kernels and partial line digraphs
• Kernels and perfectness in arc-local tournament digraphs
• Large fault-tolerant interconnection networks
• Lightness of digraphs in surfaces and directed game chromatic number
• Line Digraph Iterations and the (d, k) Digraph Problem
• Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
• Line digraphs and coreflexive vertex sets
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• Maximally connected digraphs
• Note on the degree sequences of \(k\)-hypertournaments
• On \(k\)-hypertournament matrices
• On a class of posets and the corresponding comparability graphs
• On arc-coloring of subcubic graphs
• On characterizing game-perfect graphs by forbidden induced subgraphs
• On connectivity of consecutive-d digraphs
• On hamiltonian circuits in Cayley diagrams
• On pancyclic arcs in hypertournaments
• On score sequences of k-hypertournaments
• On scores, losing scores and total scores in \(k\)-hypertournaments
• On the (h,k)-domination numbers of iterated line digraphs
• On the arc-chromatic number of a digraph
• On the connectivity of Cayley digraphs
• On the diameter vulnerability of Kautz digraphs
• On the impossibility of directed Moore graphs
• On the linegraph of a directed-graph
• On the oriented chromatic index of oriented graphs
• On the oriented game chromatic number
• On the vertex-pancyclicity of hypertournaments
• Oriented subtrees of an arc digraph
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented vertex and arc colorings of partial 2-trees
• Pancyclic arcs in Hamiltonian cycles of hypertournaments
• Paths and cycles in extended and decomposable digraphs
• Perfect digraphs
• Perfect graphs are kernel solvable
• Perfect graphs, kernels, and cores of cooperative games
• Precedence Constraints and Arrow Diagrams
• Primitivity is hereditary for 2-structures
• Quadratic assignment problems on series-parallel digraphs
• Recent problems and results about kernels in directed graphs
• Recognition and characterization of chronological interval digraphs
• Recognizing Berge graphs
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Reducibility among combinatorial problems
• Regular Hypertournaments and Arc-Pancyclicity
• Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs
• Representing digraphs using intervals or circular arcs
• Restricted connectivity of line digraphs
• Sandpile groups and spanning trees of directed line graphs
• Scores, inequalities and regular hypertournaments
• Semikernels and (k,l)-Kernels in Digraphs
• Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Sequencing with Series-Parallel Precedence Constraints
• Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
• Short proofs for interval digraphs
• Some mathematical properties of cayley digraphs with applications to interconnection network design
• Some properties of line digraphs
• Super connectivity of line graphs and digraphs
• Super edge-connectivity of dense digraphs and graphs
• Super line-connectivity of consecutive-\(d\) digraphs
• Super link-connectivity of iterated line digraphs.
• The Hamiltonian property of consecutive-\(d\) digraphs
• The Path Partition Conjecture is true for some generalizations of tournaments
• The Recognition of Series Parallel Digraphs
• The \(H\)-force set of a hypertournament
• The dichromatic number of a digraph
• The line digraph of a regular and pancircular digraph is also regular and pancircular
• The rotation graphs of perfect matchings of plane bipartite graphs
• The strong game colouring number of directed graphs
• The strong perfect graph theorem
• The structure of strong arc-locally in-semicomplete digraphs
• The structure of strong arc-locally semicomplete digraphs
• The underlying graph of a line digraph
• Transformations of digraphs viewed as intersection digraphs
• Uniform sampling of k-hypertournaments
• Vertex-pancyclicity of hypertournaments
• k-kernels in k-transitive and k-quasi-transitive digraphs

Cited in

(4)

• Difference labelling of digraphs
• Species on digraphs
• Game-perfect semiorientations of forests
• Flag: a self-dual modality for non-commutative contraction and duplication in the category of coherence spaces

This page was built for publication: Miscellaneous digraph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120443)