×

Found 206 Documents (Results 1–100)

Small universal graphs. (English) Zbl 1345.05097

Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 741-749 (1999).
MSC:  05C85 05C35
PDFBibTeX XMLCite
Full Text: DOI

All pairs lightest shortest paths. (English) Zbl 1345.05106

Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 61-69 (1999).
PDFBibTeX XMLCite
Full Text: DOI

Maximum outdegrees in a digraph whose nodes are graphs with bounded degree. (English) Zbl 1109.05310

Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 23-26 (1999).
MSC:  05C20 05C35
PDFBibTeX XMLCite

Maximally connected hyperdigraphs. (English) Zbl 1109.05316

Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 62-64 (1999).
PDFBibTeX XMLCite

Absorbing common subgraphs revisited. (English) Zbl 1109.05313

Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 149-151 (1999).
MSC:  05C35
PDFBibTeX XMLCite

Some extremal properties of the degree distance of a graph. (English) Zbl 0997.05051

Smeureanu, Ion (ed.) et al., Information technology. Proceedings of the 4th international symposium on economic informatics held in Bucharest, Romania, May 6-9, 1999. Bucharest: Editura Inforec. 651-656 (1999).
MSC:  05C35 05C12
PDFBibTeX XMLCite

Solving the traveling circus problem by branch & cut. (English) Zbl 1038.90547

Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
MSC:  90C35 05C85 05C35
PDFBibTeX XMLCite
Full Text: Link

Patches with minimal boundary length. (English) Zbl 1072.05538

Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
MSC:  05C35
PDFBibTeX XMLCite
Full Text: Link

The generalized minimum spanning tree: polyhedra and branch-and-cut. (English) Zbl 1038.90546

Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
MSC:  90C35 90C57 05C35
PDFBibTeX XMLCite
Full Text: Link

On bounds for the rotation distance between binary coupling trees. (English) Zbl 1039.05515

Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
MSC:  05C35 05C05
PDFBibTeX XMLCite
Full Text: Link

STEINER-diagrams. (English) Zbl 1039.05530

Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
MSC:  05C85 05C20 05C35
PDFBibTeX XMLCite
Full Text: Link

Geodesic iteration number. (English) Zbl 0957.05060

Balakrishnan, R. (ed.) et al., Graph connections. Proceedings of the conference, Cochin, India, January 28-31, 1998. New Delhi: Allied Publishers Limited. 91-94 (1999).
MSC:  05C35 05C38
PDFBibTeX XMLCite

The space of parallel linear networks with a fixed boundary. (English. Russian original) Zbl 0967.05039

Izv. Math. 63, No. 5, 923-962 (1999); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 63, No. 4, 83-126 (1999).
PDFBibTeX XMLCite
Full Text: DOI

The acyclic colouring, triangle number and chromatic polynomial of a graph. (English) Zbl 0952.05027

Shum, Kar-Ping (ed.) et al., Algebras and combinatorics. Papers from the international congress, ICAC’97, Hong Kong, August 1997. Singapore: Springer. 217-236 (1999).
MSC:  05C15 05C35 05C75
PDFBibTeX XMLCite

On bounds for the \(k\)-partitioning of graphs. (English) Zbl 0949.05042

Asano, Takao (ed.) et al., Computing and combinatorics. 5th annual international conference. COCOON ’99, Tokyo, Japan, July 26-28, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1627, 154-163 (1999).
MSC:  05C35 05C70 68R10
PDFBibTeX XMLCite
Full Text: DOI

A polynomial algorithm for finding largest independent sets in fork-free graphs. (English. Russian original) Zbl 0931.05078

Discrete Appl. Math. 135, No. 1-3, 3-16 (2004); translation from Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 4, 3-19 (1999).
MSC:  05C85 05C69 05C35
PDFBibTeX XMLCite
Full Text: DOI

Residual reliability of \(P\)-threshold graphs. (English. Russian original) Zbl 0930.05089

Discrete Appl. Math. 135, No. 1-3, 83-95 (2004); translation from Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 3, 71-86 (1999).
MSC:  05C85 05C35 05C90
PDFBibTeX XMLCite
Full Text: DOI

Objects determined by \(n\) points. (English) Zbl 0957.52005

Bálint, V. (ed.), Proceedings of the international scientific conference on mathematics, Žilina, Slovakia, June 30-July 3, 1998. Vol. II. Žilina: EDIS, Žilina University Publisher. 13-18 (1999).
PDFBibTeX XMLCite

Ramsey theory and partially ordered sets. (English) Zbl 0930.06006

Graham, Ronald L. (ed.) et al., Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 337-347 (1999).
MSC:  06A07 05D10 05C35
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

Biographic Reference