Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Deciding soccer scores and partial orientations of graphs.”
Graph minors and minimum degree.
Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
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:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two linear time algorithms for MST on minor closed graph classes
Martin Mareš (2004)
Archivum Mathematicum
Similarity:
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.
Generalized connected domination in graphs.
Kouider, Mekkia, Vestergaard, Preben Dahl (2006)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cordial deficiency.
Riskin, Adrian (2007)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Helly Property for Subtrees
Jessica Enright, Piotr Rudnicki (2008)
Formalized Mathematics
Similarity:
We prove, following [5, p. 92], that any family of subtrees of a finite tree satisfies the Helly property.MML identifier: HELLY, version: 7.8.09 4.97.1001