Independence number of iterated line digraphs
type: Item
instance of: scholarly article
title: Independence number of iterated line digraphs
zbMATH Open document ID: 1062.05112
author: Nicolas Lichiardopol
published in: Discrete Mathematics
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 2173241
zbMATH Keywords: Line digraph
zbMATH Keywords: Independent set
zbMATH Keywords: Independence number
MaRDI profile type: Publication
full work available at URL: j.disc.2004.08.030
OpenAlex ID: W2046024550
cites work: Covering the de Bruijn graph
cites work: Q4040797
cites work: Q5345642
DOI: 10.1016/J.DISC.2004.08.030
Recommended article: Independence number in \(n\)-extendable graphs
Recommended article: Independent restricted domination and the line digraph
Recommended article: Independence number and vertex-disjoint cycles
Recommended article: Q5478339
Recommended article: Independence number of graphs and line graphs of trees by means of omega invariant
Recommended article: Q4527723
Recommended article: Q3541516
Recommended article: Q5033172
Recommended article: The independence number of graphs in terms of degrees
Recommended article: Q4735211
description: scientific article; zbMATH DE number 2173241