On a generalization of the matroid
Zofia Majcher, Jerzy Płonka (1984)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Matroids in terms of Cayley graphs and some related results.”
On a generalization of the matroid
A characterization of middle graphs and a matroid associated with middle graphs of hypergraphs
Mieczysław Borowiecki (1983)
Fundamenta Mathematicae
Similarity:
Dual properties within graph theory
T. McKee (1987)
Fundamenta Mathematicae
Similarity:
The planarity theorems of MacLane and Whitney for graph-like continua.
Christian, Robin, Richter, R.Bruce, Rooney, Brendan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Glossary of signed and gain graphs and allied areas.
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bipartite graphs that are not circle graphs
André Bouchet (1999)
Annales de l'institut Fourier
Similarity:
The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in . At the end of this short note I briefly recall the work of François Jaeger on circle graphs.
Transversal and cotransversal matroids via their representations.
Ardila, Federico (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: