Miscellaneous Digraph Classes
From MaRDI portal
Publication:3120443
DOI10.1007/978-3-319-71840-8_11zbMath1407.05109OpenAlexW2808918505MaRDI QIDQ3120443
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
Related Items
Cites Work
- On pancyclic arcs in hypertournaments
- Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
- Recognition and characterization of chronological interval digraphs
- A classification of all arc-locally semicomplete digraphs
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- On the \((h,k)\)-domination numbers of iterated line digraphs
- Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs
- Sandpile groups and spanning trees of directed line graphs
- Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
- The rotation graphs of perfect matchings of plane bipartite graphs
- Some properties of line digraphs
- Oriented vertex and arc colorings of outerplanar graphs
- The strong perfect graph theorem
- Primitivity is hereditary for 2-structures
- Directed defective asymmetric graph coloring games
- Kernels and partial line digraphs
- Lightness of digraphs in surfaces and directed game chromatic number
- Asymmetric directed graph coloring games
- The structure of strong arc-locally in-semicomplete digraphs
- A compact labelling scheme for series-parallel graphs
- The line digraph of a regular and pancircular digraph is also regular and pancircular
- Large fault-tolerant interconnection networks
- Perfect graphs are kernel solvable
- A note on kernel-critical graphs
- On the arc-chromatic number of a digraph
- On hamiltonian circuits in Cayley diagrams
- Connection digraphs and second-order line digraphs
- A note on line digraphs and the directed max-cut problem
- Connectivity of consecutive-\(d\) digraphs
- Super edge-connectivity of dense digraphs and graphs
- The underlying graph of a line digraph
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- On a class of posets and the corresponding comparability graphs
- On the impossibility of directed Moore graphs
- Isomorphism of circulant graphs and digraphs
- The Hamiltonian property of consecutive-\(d\) digraphs
- An interval digraph in relation to its associated bipartite graph
- Cycles through \(k\) vertices in bipartite tournaments
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- Paths and cycles in extended and decomposable digraphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Hamiltonian cycles in circulant digraphs with two stripes
- Short proofs for interval digraphs
- Automorphism groups and isomorphisms of Cayley digraphs
- Super line-connectivity of consecutive-\(d\) digraphs
- Super link-connectivity of iterated line digraphs.
- On \(k\)-hypertournament matrices
- Line digraphs and coreflexive vertex sets
- On score sequences of \(k\)-hypertournaments
- Independence number of iterated line digraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- The structure of strong arc-locally semicomplete digraphs
- The dichromatic number of a digraph
- On connectivity of consecutive-\(d\) digraphs
- Representing digraphs using intervals or circular arcs
- On the diameter vulnerability of Kautz digraphs
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- The Path Partition Conjecture is true for some generalizations of tournaments
- Game-perfect digraphs
- The strong game colouring number of directed graphs
- On the connectivity of Cayley digraphs
- Game colouring directed graphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Super connectivity of line graphs and digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Kernels and perfectness in arc-local tournament digraphs
- A conjecture on 3-anti-quasi-transitive digraphs
- On the vertex-pancyclicity of hypertournaments
- The \(H\)-force set of a hypertournament
- Note on the degree sequences of \(k\)-hypertournaments
- Recognizing Berge graphs
- Chronological orderings of interval digraphs
- Fully dynamic recognition algorithm and certificate for directed cographs
- On arc-coloring of subcubic graphs
- A note on the number of spanning trees of line digraphs
- On the linegraph of a directed-graph
- Arc colorings of digraphs
- A characterization of perfect graphs
- Recent problems and results about kernels in directed graphs
- Adjusted Interval Digraphs
- A classification of arc-locally semicomplete digraphs
- Scores, inequalities and regular hypertournaments
- Arc-Disjoint Paths in Decomposable Digraphs
- PANCYCLIC ARCS IN HAMILTONIAN CYCLES OF HYPERTOURNAMENTS
- Regular Hypertournaments and Arc-Pancyclicity
- A Bijective Proof of a Theorem of Knuth
- Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph
- Connectivity of Regular Directed Graphs with Small Diameters
- Line Digraph Iterations and the (d, k) Digraph Problem
- Edge-disjoint Hamiltonian cycles in hypertournaments
- (k,l)-kernels in line digraphs
- Oriented vertex and arc colorings of partial 2-trees
- Vertex-pancyclicity of hypertournaments
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- A Design for Directed Graphs with Minimum Diameter
- A Linear Recognition Algorithm for Cographs
- Connectivity of circulant digraphs
- Quadratic assignment problems on series-parallel digraphs
- Interval digraphs: An analogue of interval graphs
- Sequencing with Series-Parallel Precedence Constraints
- Design to Minimize Diameter on Building-Block Network
- The Recognition of Series Parallel Digraphs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Maximally connected digraphs
- Broadcasting and Gossiping in de Bruijn Networks
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
- Hamiltonian paths and cycles in hypertournaments
- Semikernels and (k,l)-Kernels in Digraphs
- A complete axiomatisation for the inclusion of series-parallel partial orders
- Disproof of a conjecture about independent branchings in k‐connected directed graphs
- Digraphs with the path‐merging property
- Uniform sampling ofk-hypertournaments
- Reducibility among Combinatorial Problems
- On scores, losing scores and total scores in hypertournaments
- Perfect Digraphs
- Transformations of Digraphs Viewed as Intersection Digraphs
- Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
- On the oriented chromatic index of oriented graphs
- Interval Tournaments
- (k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings
- Some mathematical properties of cayley digraphs with applications to interconnection network design
- Digraphs
- Precedence Constraints and Arrow Diagrams
- Oriented subtrees of an arc digraph
- A new solvable case of the traveling salesman problem
- Finding an induced subdivision of a digraph
- A survey: Hamiltonian cycles in Cayley graphs
- Independent spanning trees with small depths in iterated line digraphs
- On the oriented game chromatic number
- A broadcasting protocol in line digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
