Enumerative Properties of Ferrers Graphs

Discrete and Computational Geometry - United States
doi 10.1007/s00454-004-1135-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Properties of $\Theta$-Super Positive Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

Hamiltonian Properties of Generalized Halin Graphs

Canadian Mathematical Bulletin
Mathematics
2009English

Elementary Properties of Vector Space Graphs

Bulletin of the Australian Mathematical Society
Mathematics
1984English

Enumerative Induction and Lawlikeness

English

Rook Theory. I. Rook Equivalence of Ferrers Boards

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Book Review: Enumerative Combinatorics, Vol. I

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1987English

Certificates for Properties of Stability Polynomials of Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2014English

A New Branch of Enumerative Graph Theory

Bulletin of the American Mathematical Society
1962English

Subgraph Conditions for Hamiltonian Properties of Graphs

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy