Degree-constrained edge partitioning in graphs arising from discrete tomography.
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “On subgroupoid lattices of some finite groupoid.”
Degree-constrained edge partitioning in graphs arising from discrete tomography.
Hexagonal systems. a chemistry-motivated excursion to combinatorial geometry
Ivan Gutman (2007)
The Teaching of Mathematics
Similarity:
The subalgebra lattice of a finite algebra
Konrad Pióro (2014)
Open Mathematics
Similarity:
The aim of this paper is to characterize pairs (L, A), where L is a finite lattice and A a finite algebra, such that the subalgebra lattice of A is isomorphic to L. Next, necessary and sufficient conditions are found for pairs of finite algebras (of possibly distinct types) to have isomorphic subalgebra lattices. Both of these characterizations are particularly simple in the case of distributive subalgebra lattices. We do not restrict our attention to total algebras only, but we consider...
Cordial deficiency.
Riskin, Adrian (2007)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Short certificates for tournaments.
Alon, Noga, Ruszinkó, Miklós (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
More canonical ordering.
Badent, Melanie, Brandes, Ulrik, Cornelsen, Sabine (2011)
Journal of Graph Algorithms and Applications
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regulated buildups of 3-configurations
Václav J. Havel (1994)
Archivum Mathematicum
Similarity:
We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations...