On the contour of bipartite graphs

DOI10.1016/j.dam.2016.10.017zbMath1387.05128OpenAlexW2557881668MaRDI QIDQ1752491

R. Sritharan, D. Artigas

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.10.017

zbMATH Keywords

convexitycontourbipartite graphsgeodetic set

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The contour of a bridged graph is geodetic
• Geodeticity of the contour of chordal bipartite graphs
• On the geodeticity of the contour of a graph
• On finite convexity spaces induced by sets of paths in graphs
• Convex sets in lexicographic products of graphs
• On rigid circuit graphs
• On geodetic sets formed by boundary vertices
• Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
• Some remarks on the geodetic number of a graph
• On the computation of the hull number of a graph
• The theory of convex geometries
• Bridged graphs and geodesic convexity
• Convexity in graphs
• Boundary vertices in graphs
• Partitioning a graph into convex sets
• On the contour of graphs
• Geodeticity of the contour of chordal graphs
• Rebuilding convex sets in graphs
• Geodesic Convexity in Graphs
• Conditions for invariance of set diameters under d-convexification in a graph
• Convexity in Graphs and Hypergraphs
• Perfect Elimination and Chordal Bipartite Graphs
• Convexity and HHD-Free Graphs

This page was built for publication: On the contour of bipartite graphs