Miscellaneous Digraph Classes (Q3120443)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Miscellaneous Digraph Classes	scientific article

Statements

scholarly article

0 references

Miscellaneous Digraph Classes (English)

0 references

zbMATH Open document ID

0 references

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

0 references

0 references

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_11

0 references

0 references

On the linegraph of a directed-graph

0 references

Isomorphism of circulant graphs and digraphs

0 references

Asymmetric directed graph coloring games

0 references

Directed defective asymmetric graph coloring games

0 references

Game-perfect digraphs

0 references

Lightness of digraphs in surfaces and directed game chromatic number

0 references

0 references

Perfect Digraphs

0 references

The Path Partition Conjecture is true for some generalizations of tournaments

0 references

Kernels and partial line digraphs

0 references

Digraphs with the path‐merging property

0 references

The structure of strong arc-locally semicomplete digraphs

0 references

0 references

Paths and cycles in extended and decomposable digraphs

0 references

Finding an induced subdivision of a digraph

0 references

Arc-Disjoint Paths in Decomposable Digraphs

0 references

Cycles through \(k\) vertices in bipartite tournaments

0 references

0 references

A complete axiomatisation for the inclusion of series-parallel partial orders

0 references

Connection digraphs and second-order line digraphs

0 references

Recent problems and results about kernels in directed graphs

0 references

Broadcasting and Gossiping in de Bruijn Networks

0 references

Large fault-tolerant interconnection networks

0 references

A broadcasting protocol in line digraphs

0 references

HOW TO DRAW A SERIES-PARALLEL DIGRAPH

0 references

A Bijective Proof of a Theorem of Knuth

0 references

Perfect graphs are kernel solvable

0 references

Perfect graphs, kernels, and cores of cooperative games

0 references

A Simple Linear Time LexBFS Cograph Recognition Algorithm

0 references

On the impossibility of directed Moore graphs

0 references

Interval Tournaments

0 references

Super line-connectivity of consecutive-\(d\) digraphs

0 references

The strong game colouring number of directed graphs

0 references

Super link-connectivity of iterated line digraphs.

0 references

Recognizing Berge graphs

0 references

The strong perfect graph theorem

0 references

A note on line digraphs and the directed max-cut problem

0 references

A Linear Recognition Algorithm for Cographs

0 references

Fully dynamic recognition algorithm and certificate for directed cographs

0 references

Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey

0 references

Recognition and characterization of chronological interval digraphs

0 references

An interval digraph in relation to its associated bipartite graph

0 references

0 references

0 references

The Hamiltonian property of consecutive-\(d\) digraphs

0 references

On the diameter vulnerability of Kautz digraphs

0 references

On connectivity of consecutive-\(d\) digraphs

0 references

Connectivity of consecutive-\(d\) digraphs

0 references

Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs

0 references

0 references

A note on kernel-critical graphs

0 references

Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)

0 references

Primitivity is hereditary for 2-structures

0 references

Maximally connected digraphs

0 references

Adjusted Interval Digraphs

0 references

Line Digraph Iterations and the (d, k) Digraph Problem

0 references

Kernels and perfectness in arc-local tournament digraphs

0 references

A classification of arc-locally semicomplete digraphs

0 references

A classification of all arc-locally semicomplete digraphs

0 references

Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor

0 references

Independent sets and non-augmentable paths in generalizations of tournaments

0 references

(k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings

0 references

Semikernels and (<i>k,l</i>)-Kernels in Digraphs

0 references

Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph

0 references

Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs

0 references

0 references

Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs

0 references

PANCYCLIC ARCS IN HAMILTONIAN CYCLES OF HYPERTOURNAMENTS

0 references

0 references

Hamiltonian paths and cycles in hypertournaments

0 references

Cycles and paths in bipartite tournaments with spanning configurations

0 references

On the connectivity of Cayley digraphs

0 references

Some properties of line digraphs

0 references

0 references

Arc colorings of digraphs

0 references

Independent spanning trees with small depths in iterated line digraphs

0 references

On the \((h,k)\)-domination numbers of iterated line digraphs

0 references

0 references

0 references

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

0 references

0 references

Disproof of a conjecture about independent branchings in <i>k</i>‐connected directed graphs

0 references

A Design for Directed Graphs with Minimum Diameter

0 references

Design to Minimize Diameter on Building-Block Network

0 references

Connectivity of Regular Directed Graphs with Small Diameters

0 references

The line digraph of a regular and pancircular digraph is also regular and pancircular

0 references

On a class of posets and the corresponding comparability graphs

0 references

Reducibility among Combinatorial Problems

0 references

Scores, inequalities and regular hypertournaments

0 references

Uniform sampling of<i>k</i>-hypertournaments

0 references

On scores, losing scores and total scores in hypertournaments

0 references

Oriented subtrees of an arc digraph

0 references

On \(k\)-hypertournament matrices

0 references

0 references

0 references

Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

0 references

Sandpile groups and spanning trees of directed line graphs

0 references

On the vertex-pancyclicity of hypertournaments

0 references

On pancyclic arcs in hypertournaments

0 references

The \(H\)-force set of a hypertournament

0 references

Independence number of iterated line digraphs

0 references

Line digraphs and coreflexive vertex sets

0 references

A characterization of perfect graphs

0 references

Super connectivity of line graphs and digraphs

0 references

(k,l)-kernels in line digraphs

0 references

0 references

0 references

Sequencing with Series-Parallel Precedence Constraints

0 references

Recognizing interval digraphs and interval bigraphs in polynomial time

0 references

On the oriented game chromatic number

0 references

The dichromatic number of a digraph

0 references

Oriented vertex and arc colorings of partial 2-trees

0 references

On the oriented chromatic index of oriented graphs

0 references

Line-digraphs, arborescences and theorems of Tutte and Knuth

0 references

Edge-disjoint Hamiltonian cycles in hypertournaments

0 references

On arc-coloring of subcubic graphs

0 references

Oriented vertex and arc colorings of outerplanar graphs

0 references

On the arc-chromatic number of a digraph

0 references

0 references

0 references

0 references

Quadratic assignment problems on series-parallel digraphs

0 references

Precedence Constraints and Arrow Diagrams

0 references

0 references

Interval digraphs: An analogue of interval graphs

0 references

Chronological orderings of interval digraphs

0 references

Representing digraphs using intervals or circular arcs

0 references

0 references

Super edge-connectivity of dense digraphs and graphs

0 references

A compact labelling scheme for series-parallel graphs

0 references

Regular Hypertournaments and Arc-Pancyclicity

0 references

A new solvable case of the traveling salesman problem

0 references

0 references

The Recognition of Series Parallel Digraphs

0 references

0 references

Connectivity of circulant digraphs

0 references

The underlying graph of a line digraph

0 references

0 references

Note on the degree sequences of \(k\)-hypertournaments

0 references

A conjecture on 3-anti-quasi-transitive digraphs

0 references

0 references

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

0 references

The structure of strong arc-locally in-semicomplete digraphs

0 references

Short proofs for interval digraphs

0 references

On hamiltonian circuits in Cayley diagrams

0 references

A survey: Hamiltonian cycles in Cayley graphs

0 references

Some mathematical properties of cayley digraphs with applications to interconnection network design

0 references

A note on the number of spanning trees of line digraphs

0 references

Automorphism groups and isomorphisms of Cayley digraphs

0 references

Game colouring directed graphs

0 references

Vertex-pancyclicity of hypertournaments

0 references

Hamiltonian cycles in circulant digraphs with two stripes

0 references

Transformations of Digraphs Viewed as Intersection Digraphs

0 references

0 references

The rotation graphs of perfect matchings of plane bipartite graphs

0 references

0 references

On score sequences of \(k\)-hypertournaments

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3120443

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