Recognizing Chordal Graphs: Lex BFS and MCS1
By: Broderick Arneson and Piotr Rudnicki
Open Access
|Jun 2008References
- [1] Broderick Arneson and Piotr Rudnicki. Chordal graphs., 14(3):79-92, 2006.
- [2] Grzegorz Bancerek. Cardinal numbers., 1(2):377-382, 1990.
- [3] Grzegorz Bancerek. The fundamental properties of natural numbers., 1(1):41-46, 1990.
- [4] Grzegorz Bancerek. The ordinal numbers., 1(1):91-96, 1990.
- [5] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1(1):107-114, 1990.
- [6] Czesław Byliński. A classical first order language., 1(4):669-676, 1990.
- [7] Czesław Byliński. Functions and their basic properties., 1(1):55-65, 1990.
- [8] Czesław Byliński. Functions from a set to a set., 1(1):153-164, 1990.
- [9] Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function., 1(3):521-527, 1990.
- [10] Czesław Byliński. Partial functions., 1(2):357-367, 1990.
- [11] Czesław Byliński. Some basic properties of sets., 1(1):47-53, 1990.
- [12] Agata Darmochwał. Finite sets., 1(1):165-167, 1990.
- [13] M. Ch. Golumbic.Academic Press, New York, 1980.
- [14] Jarosław Kotowicz. Monotone real sequences. Subsequences., 1(3):471-475, 1990.
- [15] Gilbert Lee. Walks in Graphs., 13(2):253-269, 2005.
- [16] Gilbert Lee. Weighted and Labeled Graphs., 13(2):279-293, 2005.
- [17] Gilbert Lee and Piotr Rudnicki. On ordering of bags., 10(1):39-46, 2002.
- [18] Gilbert Lee and Piotr Rudnicki. Alternative graph structures., 13(2):235-252, 2005.
- [19] Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, I., 5(2):167-172, 1996.
- [20] Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics., 4(1):83-86, 1993.
- [21] Piotr Rudnicki. Little Bezout theorem (factor theorem)., 12(1):49-58, 2004.
- [22] Piotr Rudnicki and Andrzej Trybulec. Abian's fixed point theorem., 6(3):335-338, 1997.
- [23] Piotr Rudnicki and Andrzej Trybulec. Multivariate polynomials with arbitrary number of variables., 9(1):95-110, 2001.
- [24] Christoph Schwarzweller. Term orders., 11(1):105-111, 2003.
- [25] R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs., 13(3):566-579, 1984.
- [26] Andrzej Trybulec. Subsets of complex numbers.
- [27] Andrzej Trybulec. Domains and their Cartesian products., 1(1):115-122, 1990.
- [28] Andrzej Trybulec. Tarski Grothendieck set theory., 1(1):9-11, 1990.
- [29] Andrzej Trybulec. Many-sorted sets., 4(1):15-22, 1993.
- [30] Andrzej Trybulec. On the sets inhabited by numbers., 11(4):341-347, 2003.
- [31] Wojciech A. Trybulec. Pigeon hole principle., 1(3):575-579, 1990.
- [32] Zinaida Trybulec. Properties of subsets., 1(1):67-71, 1990.
- [33] Edmund Woronowicz. Relations and their basic properties., 1(1):73-83, 1990.
- [34] Edmund Woronowicz. Relations defined on sets., 1(1):181-186, 1990.
- [35] Edmund Woronowicz and Anna Zalewska. Properties of binary relations., 1(1):85-89, 1990.
Language: English
Page range: 187 - 206
Published on: Jun 13, 2008
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
© 2008 Broderick Arneson, Piotr Rudnicki, published by University of Białystok
This work is licensed under the Creative Commons License.