On a conjecture concerning the Petersen graph.
Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Local equivalence of transversals in matroids.”
On a conjecture concerning the Petersen graph.
Multimatroids. II: Orthogonality, minors and connectivity.
Bouchet, André (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphical condensation, overlapping Pfaffians and superpositions of matchings.
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs.
Gebauer, Heidi (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Heterochromatic matchings in edge-colored graphs.
Wang, Guanghui, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maxmaxflow and counting subgraphs.
Jackson, Bill, Sokal, Alan D. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some Ramsey and Turán-type numbers for paths and cycles.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Transversal and cotransversal matroids via their representations.
Ardila, Federico (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Paths through fixed vertices in edge-colored graphs
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
Similarity:
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...
A note on the distance-balanced property of generalized Petersen graphs.
Yang, Rui, Hou, Xinmin, Li, Ning, Zhong, Wei (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: