Results 1 to 10 of about 147,158 (196)
Graphical Representations of Graphic Frame Matroids [PDF]
Graphs and Combinatorics, 2015 A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, if there is one such graph, there will be many. Zaslavsky has shown that frame matroids are precisely those having a representation as a biased graph; this class includes graphic matroids, bicircular matroids, and Dowling geometries. Whitney characterized
Matt DeVos +3 more
openaire +2 more sources
On graphic elementary lifts of graphic matroids
Discrete Mathematics, 2022 Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the class of graphic matroids whose all lifted-graphic matroids are also graphic using the splitting operation.
Ganesh Mundhe, Y.M. Borse, K.V. Dalvi
openaire +2 more sources
Graphics for relatedness research [PDF]
Molecular Ecology Resources, 2017 AbstractStudies of relatedness have been crucial in molecular ecology over the last decades. Good evidence of this is the fact that studies of population structure, evolution of social behaviours, genetic diversity and quantitative genetics all involve relatedness research.
Iván Galván-Femenía +3 more
openaire +10 more sources
A Cap For Graphic Scores. Graphic Notation And Performance
, 2017 Many graphic scores use the pitch versus time presentation, as a natural extension of the usual notation. In the general case, it displays discrete pitches, in a fixed timeline. Nevertheless, graphic scores use a lot of continuous lines, and the vertical dimension can be adapted to a particular performance.
Sluchin, Benny, Malt, Mikhail
openaire +4 more sources
The graphicity of the union of graphic matroids
European Journal of Combinatorics, 2015 There is a conjecture that if the union (also called sum) of graphic matroids is not graphic then it is nonbinary (Recski, 1982). Some special cases have been proved only, for example if several copies of the same graphic matroid are given. If there are two matroids and the first one can either be represented by a graph with two points, or is the ...
Csehi, Csongor György, Recski, András
openaire +2 more sources