Perfect matchings and ears in elementary bipartite graphs

An NP-complete matching problem

Plaisted, David A.
Zaks, Samuel

April 1980

AbstractWe show that a restricted form of the perfect matching problem for bipartite graphs is NP-co...

Perfect matching for regular graphs is AC0-hard for the general matching problem

Dahlhaus, Elias
Karpinski, Marek

February 1992

AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...

Bicolored Matchings in Some Classes of Graphs

Costa, Marie-Christine
de Werra, Dominique
Picouleau, Christophe
Ries, Bernard

August 2019

We consider the problem of finding in a graph a set R of edges to be colored in red so that there a...

Perfect matchings and ears in elementary bipartite graphs

Hansen, Pierre
Zhang, Fuji
Zheng, Maolin

November 1997

AbstractWe give lower and upper bounds for the number of reducible ears as well as upper bounds for ...

Plane elementary bipartite graphs

Zhang, Heping
Zhang, Fuji

October 2000

AbstractA connected graph is called elementary if the union of all perfect matchings forms a connect...

Number of maximum matchings of bipartite graphs with positive surplus

Liu, Yan
Liu, Guizhen

January 2004

AbstractA bipartite graph G=(A,B) is said to have positive surplus (as viewed from A) if the number ...

Plane elementary bipartite graphs

Zhang, HP
Zhang, FJ
张福基

October 2000

A connected graph is called elementary if the union of all perfect matchings forms a connected subgr...

A note on the number of perfect matchings of bipartite graphs

Fuji, Zhang
Heping, Zhang

March 1997

AbstractLet G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perf...

Coloured matchings in bipartite graphs

Cameron, Kathie

May 1997

AbstractA theorem of Stein (1975, 1979) states that for every n × n (n ⩾ 3) complete bipartite graph...

Some elementary lower bounds on the matching number of bipartite graphs

Iride Gramajo

December 2014

In this paper we present some elementary results on the matching number of bipartite graphs. Most of...

Elementary Bipartite Graphs and Unique Colourability

Bacsó, Gábor

April 2002

AbstractThe Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different ...

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs

El Maalouly, Nicolas
Wulf, Lasse

January 2023

In 1982 Papadimitriou and Yannakakis introduced the Exact Matching problem, in which given a red and...

Existence of perfect matchings in a plane bipartite graph

Che, Zhongyuan

January 2010

summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...

On the NP-completeness of the perfect matching free subgraph problem

Lacroix, Mathieu
Ridha Mahjoub, A.
Martin, Sébastien
Picouleau, Christophe

March 2012

AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...

Some tight bounds on the minimum and maximum forcing numbers of graphs

Liu, Qianqian
Zhang, Heping

December 2021

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ ...

An NP-complete matching problem

Plaisted, David A.
Zaks, Samuel

April 1980

AbstractWe show that a restricted form of the perfect matching problem for bipartite graphs is NP-co...

Perfect matching for regular graphs is AC0-hard for the general matching problem

Dahlhaus, Elias
Karpinski, Marek

February 1992

AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...

Bicolored Matchings in Some Classes of Graphs

Costa, Marie-Christine
de Werra, Dominique
Picouleau, Christophe
Ries, Bernard

August 2019

We consider the problem of finding in a graph a set R of edges to be colored in red so that there a...

Perfect matchings and ears in elementary bipartite graphs

Hansen, Pierre
Zhang, Fuji
Zheng, Maolin

November 1997

AbstractWe give lower and upper bounds for the number of reducible ears as well as upper bounds for ...

Plane elementary bipartite graphs

Zhang, Heping
Zhang, Fuji

October 2000

AbstractA connected graph is called elementary if the union of all perfect matchings forms a connect...

Number of maximum matchings of bipartite graphs with positive surplus

Liu, Yan
Liu, Guizhen

January 2004

AbstractA bipartite graph G=(A,B) is said to have positive surplus (as viewed from A) if the number ...

Plane elementary bipartite graphs

Zhang, HP
Zhang, FJ
张福基

October 2000

A connected graph is called elementary if the union of all perfect matchings forms a connected subgr...

A note on the number of perfect matchings of bipartite graphs

Fuji, Zhang
Heping, Zhang

March 1997

AbstractLet G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perf...

Coloured matchings in bipartite graphs

Cameron, Kathie

May 1997

AbstractA theorem of Stein (1975, 1979) states that for every n × n (n ⩾ 3) complete bipartite graph...

Some elementary lower bounds on the matching number of bipartite graphs

Iride Gramajo

December 2014

In this paper we present some elementary results on the matching number of bipartite graphs. Most of...

Elementary Bipartite Graphs and Unique Colourability

Bacsó, Gábor

April 2002

AbstractThe Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different ...

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs

El Maalouly, Nicolas
Wulf, Lasse

January 2023

In 1982 Papadimitriou and Yannakakis introduced the Exact Matching problem, in which given a red and...

Existence of perfect matchings in a plane bipartite graph

Che, Zhongyuan

January 2010

summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...

On the NP-completeness of the perfect matching free subgraph problem

Lacroix, Mathieu
Ridha Mahjoub, A.
Martin, Sébastien
Picouleau, Christophe

March 2012

AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...

Some tight bounds on the minimum and maximum forcing numbers of graphs

Liu, Qianqian
Zhang, Heping

December 2021

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ ...

An NP-complete matching problem

Plaisted, David A.
Zaks, Samuel

April 1980

AbstractWe show that a restricted form of the perfect matching problem for bipartite graphs is NP-co...

Perfect matching for regular graphs is AC0-hard for the general matching problem

Dahlhaus, Elias
Karpinski, Marek

February 1992

AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...

Bicolored Matchings in Some Classes of Graphs

Costa, Marie-Christine
de Werra, Dominique
Picouleau, Christophe
Ries, Bernard

August 2019

We consider the problem of finding in a graph a set R of edges to be colored in red so that there a...

Perfect matchings and ears in elementary bipartite graphs

Abstract

Extracted data

Perfect matchings and ears in elementary bipartite graphs

Abstract

Extracted data

Related items

Related items