Equistarable bipartite graphs

DOI10.1016/j.disc.2015.07.009zbMath1334.05110DBLPjournals/dm/BorosCM16arXiv1502.06343OpenAlexW2963631220WikidataQ59560470 ScholiaQ59560470MaRDI QIDQ279223

Nina Chiarelli, Endre Boros, Martin Milanič

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphequistable graphgeneral partition graph2-extendable graphequistarable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Detecting strong cliques ⋮ Strong cliques and equistability of EPT graphs

Cites Work

• Unnamed Item
• A class of threshold and domishold graphs: Equistable and equidominating graphs
• Matching theory
• On n-extendable graphs
• A structure theorem for maximum internal matchings in graphs
• Equistable chordal graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Equistable graphs, general partition graphs, triangle graphs, and graph products
• A characterization and hereditary properties for partition graphs
• Recent examples in the theory of partition graphs
• Tutte type theorems for graphs having a perfect internal matching
• Equistable simplicial, very well-covered, and line graphs
• Equistable distance-hereditary graphs
• Oriented star packings
• Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
• Deciding the deterministic property for soliton graphs
• Equistable graphs
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Equistarable bipartite graphs