The pre-hull number and lexicographic product

DOI10.1016/j.disc.2011.08.031zbMath1244.05080OpenAlexW2127155173MaRDI QIDQ432717

Iztok Peterin

Publication date: 4 July 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.031

zbMATH Keywords

lexicographic product(Geodesic) convexitypre-hull number

Mathematics Subject Classification ID

Distance in graphs (05C12) General convexity (52A99)

Related Items (4)

Hull number: \(P_5\)-free graphs and reduction rules ⋮ A general framework for path convexities ⋮ Some Steiner concepts on lexicographic products of graphs ⋮ On the geodetic iteration number of distance-hereditary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Convex sets in lexicographic products of graphs
• Recognizing Cartesian products in linear time
• On the geodesic pre-hull number of a graph
• Convex sets in graphs. II: Minimal path convexity
• Convexity in graphs
• On triangle path convexity in graphs
• The induced path convexity, betweenness, and svelte graphs
• Convexities related to path properties on graphs
• Connectivity of strong products of graphs
• The geodetic number of the lexicographic product of graphs
• On Cartesian skeletons of graphs
• Game coloring the Cartesian product of graphs
• Power Domination in Product Graphs
• Convexity in Graphs and Hypergraphs
• Small cycle double covers of products I: Lexicographic product with paths and cycles
• Game chromatic number of Cartesian product graphs

This page was built for publication: The pre-hull number and lexicographic product