On the monophonic rank of a graph

DOI10.46298/dmtcs.6835zbMath1515.05054arXiv2010.01365OpenAlexW4296362413MaRDI QIDQ6045452

Unnamed Author, Unnamed Author, Mitre C. Dourado

Publication date: 31 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphtriangle-free graphcactus graphrank of a graph\(k\)-starlike graphmonophonically convex set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-linear-time algorithm for the geodetic Radon number of grids
• Graphs with few \(P_4\)'s under the convexity of paths of order three
• Irreversible conversion of graphs
• Complexity results related to monophonic convexity
• Convex sets in graphs. II: Minimal path convexity
• On the pathwidth of chordal graphs
• Computing the hull number in \(\Delta \)-convexity
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• On the geodetic rank of a graph
• Optimal decomposition by clique separators
• Geodesic Convexity in Graphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph