648 research outputs found
Bipartite graphs with a perfect matching and digraphs
In this paper, we introduce a corresponding between bipartite graphs with a
perfect matching and digraphs, which implicates an equivalent relation between
the extendibility of bipartite graphs and the strongly connectivity of
digraphs. Such an equivalent relation explains the similar results on
-extendable bipartite graphs and -strong digraphs. We also study the
relation among -extendable bipartite graphs, -strong digraphs and
combinatorial matrices. For bipartite graphs that are not 1-extendable and
digraphs that are not strong, we prove that the elementary components and
strong components are counterparts.Comment: 2 figures, 7 pages. A short version of this paper is published in
"Advances and applications in Discrete Mathematics". This version contains
some interesting comparison between -strong digraphs and -extendable
bigraphs, which is deleted in the published versio
Matching Connectivity: On the Structure of Graphs with Perfect Matchings
We introduce the concept of matching connectivity as a notion of connectivity
in graph admitting perfect matchings which heavily relies on the structural
properties of those matchings. We generalise a result of Robertson, Seymour and
Thomas for bipartite graphs with perfect matchings (see [Neil Roberts, Paul D
Seymour, and Robin Thomas. Permanents, pfaffian orientations, and even directed
curcuits. Annals of Mathematics, 150(2):929-975, 1999]) in order to obtain a
concept of alternating paths that turns out to be sufficient for the
description of our connectivity parameter. We introduce some basic properties
of matching connectivity and prove a Menger-type result for matching
n-connected graphs. Furthermore, we show that matching connectivity fills a gap
in the investigation of n-extendable graphs and their connectivity properties.
To be more precise we show that every n-extendable graph is matching
n-connected and for the converse every matching (n+1)-connected graph either is
n-extendable, or belongs to a well described class of graphs: the brace
h-critical graphs.Comment: Error in main proo
Minimum size of n-factor-critical graphs and k-extendable graphs
We determine the minimum size of -factor-critical graphs and that of
-extendable bipartite graphs, by considering Harary graphs and related
graphs. Moreover, we determine the minimum size of -extendable non-bipartite
graphs for , and pose a related conjecture for general .Comment: 13 pages, 8 figures, published in Graphs and Combinatoric
Equivalence between Extendibility and Factor-Criticality
In this paper, we show that if , where denotes the
order of a graph, a non-bipartite graph is -extendable if and only if it
is -factor-critical. If , a graph is $k\
1/2(2k+1)$-factor-critical. We also give
examples to show that the two bounds are best possible. Our results are answers
to a problem posted by Favaron [3] and Yu [11].Comment: This paper has been published at Ars Combinatori
Surface embedding of non-bipartite -extendable graphs
We find the minimum number for any surface , such
that every -embeddable non-bipartite graph is not -extendable. In
particular, we construct the so-called bow-tie graphs , and
show that they are -extendable. This confirms the existence of an infinite
number of -extendable non-bipartite graphs which can be embedded in the
Klein bottle.Comment: 17 pages, 5 figure
Equistarable bipartite graphs
Recently, Milani\v{c} and Trotignon introduced the class of equistarable
graphs as graphs without isolated vertices admitting positive weights on the
edges such that a subset of edges is of total weight if and only if it
forms a maximal star. Based on equistarable graphs, counterexamples to three
conjectures on equistable graphs were constructed, in particular to Orlin's
conjecture, which states that every equistable graph is a general partition
graph.
In this paper we characterize equistarable bipartite graphs. We show that a
bipartite graph is equistarable if and only if every -matching of the graph
extends to a matching covering all vertices of degree at least . As a
consequence of this result, we obtain that Orlin's conjecture holds within the
class of complements of line graphs of bipartite graphs.
We also connect equistarable graphs to the triangle condition, a
combinatorial condition known to be necessary (but in general not sufficient)
for equistability. We show that the triangle condition implies general
partitionability for complements of line graphs of forests, and construct an
infinite family of triangle non-equistable graphs within the class of
complements of line graphs of bipartite graphs
Minimum k-critical bipartite graphs
We study the problem of Minimum -Critical Bipartite Graph of order
- MCBG-: to find a bipartite , with , , and
, which is -critical bipartite, and the tuple , where and denote the maximum degree in
and , respectively, is lexicographically minimum over all such graphs.
is -critical bipartite if deleting at most vertices from creates
that has a complete matching, i.e., a matching of size . We show that,
if is an integer, then a solution of the MCBG- problem
can be found among -regular bipartite graphs of order , with
, and . If , then all -regular bipartite
graphs of order are -critical bipartite. For , it is not the
case. We characterize the values of , , , and that admit an
-regular bipartite graph of order , with , and give a
simple construction that creates such a -critical bipartite graph whenever
possible. Our techniques are based on Hall's marriage theorem, elementary
number theory, linear Diophantine equations, properties of integer functions
and congruences, and equations involving them
On Perfect Matchings in Matching Covered Graphs
Let be a matching-covered graph, i.e., every edge is contained in a
perfect matching. An edge subset of is feasible if there exists two
perfect matchings and such that . Lukot'ka and Rollov\'a proved that an edge subset of a regular
bipartite graph is not feasible if and only if is switching-equivalent to
, and they further ask whether a non-feasible set of a regular graph
of class 1 is always switching-equivalent to either or ? Two
edges of are equivalent to each other if a perfect matching of
either contains both of them or contains none of them. An equivalent class of
is an edge subset with at least two edges such that the edges of
are mutually equivalent. An equivalent class is not a feasible set. Lov\'asz
proved that an equivalent class of a brick has size 2. In this paper, we show
that, for every integer , there exist infinitely many -regular
graphs of class 1 with an arbitrarily large equivalent class such that
is not switching-equivalent to either or , which provides a
negative answer to the problem proposed by Lukot'ka and Rollov\'a. Further, we
characterize bipartite graphs with equivalent class, and characterize
matching-covered bipartite graphs of which every edge is removable.Comment: 10 pages, 3 figure
On the restricted matching of graphs in surfaces
A connected graph with at least vertices is said to have
property if, for any two disjoint matchings and of size
and respectively, has a perfect matching such that
and . In particular, a graph with is
-extendable. Let be the smallest integer such that no
graphs embedded on a surface are -extendable. Aldred and Plummer
have proved that no graphs embedded on the surfaces such as the
sphere, the projective plane, the torus, and the Klein bottle are
. In this paper, we show that this result always holds
for any surface. Furthermore, we obtain that if a graph embedded on a
surface has sufficiently many vertices, then has no property for
each integer , which implies that is not -extendable. In the
case of , we get immediately a main result that Aldred et al. recently
obtained.Comment: 9 page
Notes on factor-criticality, extendibility and independence number
In this paper, we give a sufficient and necessary condition for a
-extendable graph to be -factor-critical when , and prove some
results on independence numbers in -factor-critical graphs and
-extendable graphs.Comment: This paper has been published on Ars Combinatori
- …