On the general position number of Mycielskian graphs
From MaRDI portal
Publication:6546415
DOI10.1016/J.DAM.2024.03.015zbMATH Open1540.0508MaRDI QIDQ6546415
Gabriele Di Stefano, Ullas Chandran S. V., Elias John Thomas, James Tuite
Publication date: 29 May 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some network topological notions of the Mycielskian of a graph
- The edge general position problem
- A Steiner general position problem in graph theory
- Characterization of general position sets and its applications to cographs and bipartite graphs
- Gromov hyperbolicity in Mycielskian graphs
- Connectivity of the Mycielskian of a graph
- Mutual visibility in graphs
- Finding Points in General Position
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- General d-position sets
- Italian domination on Mycielskian and Sierpinski graphs
- On independent position sets in graphs
- On the General Position Subset Selection Problem
- Sur le coloriage des graphs
- Circular chromatic number and Mycielski graphs
- General position sets in two families of Cartesian product graphs
- Edge general position sets in Fibonacci and Lucas cubes
- Extremal edge general position sets in some graphs
Related Items (1)
This page was built for publication: On the general position number of Mycielskian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546415)
