EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
From MaRDI portal
Publication:5140108
DOI10.22342/jims.21.2.230.105-116zbMath1463.05314OpenAlexW2210621856MaRDI QIDQ5140108
Deepa Sinha, Pravin Garg, Shanu Goyal
Publication date: 13 December 2020
Published in: Journal of the Indonesian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22342/jims.21.2.230.105-116
Related Items (1)
Cites Work
- Unnamed Item
- On the hardness of recognizing triangular line graphs
- Generalized line graphs: Cartesian products and complexity of recognition
- Two classes of perfect graphs
- Recognizing claw-free perfect graphs
- Gallai graphs and anti-Gallai graphs
- Small edge sets meeting all triangles of a graph
- Clique irreducibility of some iterative classes of graphs
- Gallai and anti-Gallai graphs of a graph
- A recognition algorithm for the total graphs
- Total Graphs and Traversability
- Characterization of line graphs
- Transitiv orientierbare Graphen
- Structure of Regular Total Graphs†
- The connectivity of total graphs
- The Total Group of a Graph
- Characterizations of derived graphs
- A Characterization of Total Graphs
This page was built for publication: EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS