Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (original) (raw)

A revised Moore bound for mixed graphs

Hebert Pérez Rosés

Discrete Mathematics, 2016

View PDFchevron_right

A note on the size Ramsey numbers for matchings versus cycles

Edy Tri Baskoro

Mathematica Bohemica, 2020

View PDFchevron_right

On the Validations of the Asymptotic Matching Conjectures

Shmuel Friedland

Journal of Statistical Physics, 2008

View PDFchevron_right

2-Factor hamiltonian graphs

D. Labbate

Journal of Combinatorial Theory, Series B, 2003

View PDFchevron_right

An upper bound for the number of perfect matchings in graphs

Shmuel Friedland

View PDFchevron_right

Journal of Graph Algorithms and Applications

Hoong Lau

View PDFchevron_right

Feasibility Conditions on the Parameters of a Strongly Regular Graph

Vasco Mano

Electronic Notes in Discrete Mathematics, 2011

View PDFchevron_right

On the Ramsey numbers for paths and generalized Jahangir graphs

Edy Tri Baskoro

Bulletin Mathematiques De La Societe Des Sciences Mathematiques De Roumanie, 2008

View PDFchevron_right

On Graph Domination Numbers

B Logeshwary

International Journal of Pure and Apllied Mathematics, 2015

View PDFchevron_right

Bounding and computing obstacle numbers of graphs

Siddharth Gupta

arXiv (Cornell University), 2022

View PDFchevron_right

On Polar, Trivially Perfect Graphs

Elena Nechita

International Journal of Computers Communications & Control, 2010

View PDFchevron_right

4-Prime cordiality of some classes of graphs

A.M.S. Ramasamy

international symposium on algorithms and computation, 2016

View PDFchevron_right

Asymptotical estimation of some characteristics of finite graphs

Phan Thi Dieu

RAIRO. Informatique théorique, 1977

View PDFchevron_right

Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs

Shmuel Friedland

The Electronic Journal of Combinatorics

View PDFchevron_right

Improving bounds on the order of regular graphs of girth 5

Camino Balbuena

Discrete Mathematics, 2019

View PDFchevron_right

A matching theorem for graphs

Daniel Kleitman

Journal of Combinatorial Theory, 1970

View PDFchevron_right

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs

Shibsankar Das

Scientific Annals of Computer Science

View PDFchevron_right

On defect-d matchings in graphs

Doug Grant

Discrete Mathematics, 1975

View PDFchevron_right

An improved upper bound for the order of mixed graphs

Nacho López

Discrete Mathematics, 2018

View PDFchevron_right

On the double Roman bondage numbers of graphs

Nader Jafari Rad

Discrete Mathematics, Algorithms and Applications, 2022

View PDFchevron_right

The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence

Shmuel Friedland

The Electronic Journal of Combinatorics

View PDFchevron_right

On Some Classes of Problems on Graphs

Volodymyr G. Skobelev

International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, 2019

View PDFchevron_right

Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph

Nader Jafari Rad

Graphs and Combinatorics, 2020

View PDFchevron_right

Squares of Intersection Graphs and Induced Matchings

Yury Orlovich

Electronic Notes in Discrete Mathematics, 2006

View PDFchevron_right

On large regular (1,1,k)-mixed graphs

James Tuite

arXiv (Cornell University), 2023

View PDFchevron_right