Colouring the petals of a graph.
Cariolaro, David, Cariolaro, Gianfranco (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Scheduling partial round Robin tournaments subject to home away pattern sets.”
Colouring the petals of a graph.
Glossary of signed and gain graphs and allied areas.
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a generalization of perfect -matching
Ľubica Šándorová, Marián Trenkler (1991)
Mathematica Bohemica
Similarity:
The paper is concerned with the existence of non-negative or positive solutions to , where is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.
Several results on chordal bipartite graphs
Mihály Bakonyi, Aaron Bono (1997)
Czechoslovak Mathematical Journal
Similarity:
The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite graph. As consequence, occurance of arithmetic zeros will not terminate perfect Gaussian elimination on sparse matrices having associated a chordal bipartite graph. Next, a property concerning minimal edge separators is presented. Finally, it is...
Perfect matchings in -regular graphs.
Alon, Noga, Rödl, Vojtěch, Ruciński, Andrzej (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maximum matchings in regular graphs of high girth.
Flaxman, Abraham D., Hoory, Shlomo (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Borodin, O.V., Ivanova, A.O., Stechkin, B.S. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Effect of edge-subdivision on vertex-domination in a graph
Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar (2002)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a graph with Δ(G) > 1. It can be shown that the domination number of the graph obtained from G by subdividing every edge exactly once is more than that of G. So, let ξ(G) be the least number of edges such that subdividing each of these edges exactly once results in a graph whose domination number is more than that of G. The parameter ξ(G) is called the subdivision number of G. This notion has been introduced by S. Arumugam and S. Velammal. They have conjectured that for any...