Maximum matchings in regular graphs of high girth.
Flaxman, Abraham D., Hoory, Shlomo (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Perfect matchings in -regular graphs.”
Maximum matchings in regular graphs of high girth.
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The sum of degrees in cliques.
Bollobás, Béla, Nikiforov, Vladimir (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Note on linear arboricity of graphs with large girth
Filip Guldan (1991)
Czechoslovak Mathematical Journal
Similarity:
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Polynomial time algorithms for two classes of subgraph problem
Sriraman Sridharan (2008)
RAIRO - Operations Research
Similarity:
We design a polynomial time algorithm for finding a -1)- regular subgraph in a -regular graph without any induced star (claw-free). A polynomial time algorithm for finding a cubic subgraph in a 4-regular locally connected graph is also given. A family of -regular graphs with an induced star (, not containing any (-1)-regular subgraph is also constructed.
Scheduling partial round Robin tournaments subject to home away pattern sets.
Kashiwabara, Kenji (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The linear arboricity of -regular graphs
Filip Guldan (1986)
Mathematica Slovaca
Similarity:
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some Sharp Bounds on the Negative Decision Number of Graphs
Hongyu Liang (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V,E) be a graph. A function f : V → {-1,1} is called a bad function of G if ∑u∈NG(v) f(u) ≤ 1 for all v ∈ V where NG(v) denotes the set of neighbors of v in G. The negative decision number of G, introduced in [12], is the maximum value of ∑v∈V f(v) taken over all bad functions of G. In this paper, we present sharp upper bounds on the negative decision number of a graph in terms of its order, minimum degree, and maximum degree. We also establish a sharp Nordhaus-Gaddum-type inequality...