Spanning caterpillar in biconvex bipartite graphs

DOI10.1016/J.DAM.2024.05.016zbMATH Open1544.05104MaRDI QIDQ6585242

Shashanka Kulamarva, Anita Das, Shirish Gosavi, Dalu Jacob, Dhanyamol Antony

Publication date: 9 August 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

chain graphscaterpillarbipartite permutation graphsburning numberbiconvex bipartite graphsgraph burning

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Bipartite permutation graphs
• Biconvex graphs: Ordering and algorithms
• On the burning number of \(p\)-caterpillars
• Asteroidal Triple-Free Graphs
• All trees are six-cordial
• How to Burn a Graph

This page was built for publication: Spanning caterpillar in biconvex bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585242)