Structure of cubic Lehman matrices

zbMath1420.05028arXiv1805.07576MaRDI QIDQ2325755

Irene Pivotto, Dillon Mayhew, Gordon F. Royle

Publication date: 30 September 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.07576

zbMATH Keywords

partitionable graphsLehman pair

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• A new infinite family of minimally nonideal matrices
• Ideal clutters
• The strong perfect graph theorem
• Lehman matrices
• Graphical properties related to minimal imperfection
• A classification of certain graphs with minimal imperfection properties
• Combinatorial designs related to the strong perfect graph conjecture
• A catalog of minimally nonideal matrices
• Ideal 0, 1 matrices
• Combinatorial designs and related systems
• Normal hypergraphs and the perfect graph conjecture
• Combinatorial Optimization
• On the width—length inequality
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Perfect zero–one matrices
• Recursive generation of partitionable graphs
• The connectivity of minimal imperfect graphs
• Fast generation of cubic graphs
• On Minimum Blocking Coalitions in Small Projective Plane Games
• Bottleneck extrema
• Blocking Sets in Finite Projective Planes

This page was built for publication: Structure of cubic Lehman matrices