Core and Conditional Core Path of Specified Length in Special Classes of Graphs
From MaRDI portal
Publication:3605503
Recommendations
- Degree conditions and relative length of longest paths and cycles in graphs
- Path decomposition of graphs with given path length
- On the characterization of path graphs
- scientific article; zbMATH DE number 434696
- Core graphs and \(L(2,1)\)-labeling
- Spectral conditions for the existence of specified paths and cycles in graphs
- A sufficient condition for path extendable graphs
- Various length paths in graphs
- Characterization of Graphs Using Degree Cores
- An implicit degree condition for relative length of long paths and cycles in graphs
Cites work
- scientific article; zbMATH DE number 2090005 (Why is no real title available?)
- A linear algorithm for a core of a tree
- Bipartite permutation graphs
- Conditional location of path and tree shaped facilities on trees
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Finding the \(\ell\)-core of a tree
- On computing longest paths in small graph classes
- On finding the core of a tree with a specified length
- On locating path- or tree-shaped facilities on networks
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
- The location of median paths on grid graphs
- The optimal location of a path or tree in a tree network
This page was built for publication: Core and Conditional Core Path of Specified Length in Special Classes of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605503)