×

Found 66 Documents (Results 1–66)

Making a tournament \(k\)-arc-strong by reversing arcs. (English) Zbl 1409.05093

Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 2-5 (2001).
MSC:  05C20 05C40
PDFBibTeX XMLCite
Full Text: Link

On the independent set of de Bruijn graphs. (English) Zbl 1040.05020

Kluev, V. V. (ed.) et al., Topics in applied and theoretical mathematics and computer science. Athens: WSEAS Press (ISBN 960-8052-47-6/hbk). Mathematics and Computers in Science and Engineering. A Series of Reference Books and Textbooks, 117-122 (2001).
PDFBibTeX XMLCite

Multicuts in unweighted digraphs with bounded degree and bounded tree-width. (English) Zbl 0981.05049

Szwarcfiter, Jayme (ed.), Proceedings of the Brazilian symposium on graphs, algorithms and combinatorics, Fortaleza, Ceará, Brazil, March 17-19, 2001. Extended abstracts. Amsterdam: Elsevier, Electron. Notes Discrete Math. 7, no pag., electronic only (2001).
MSC:  05C20 68R10
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 3

Main Field