Cover Image

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dailly, Antoine, Foucaud, Florent, Hansberg, Adriana
Format:	Preprint
Published:	2018
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the balanceability of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)

Progress towards the two-thirds conjecture on locating-total dominating sets
by: Chakraborty, Dipayan, et al.
Published: (2022)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

The Closed Geodetic Game: algorithms and strategies
by: Dailly, Antoine, et al.
Published: (2024)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

Partition games
by: Dailly, Antoine, et al.
Published: (2018)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Locating-dominating partitions for some classes of graphs
by: Foucaud, Florent, et al.
Published: (2025)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)

Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

On the order-diameter ratio of girth-diameter cages
by: Cambie, Stijn, et al.
Published: (2025)

The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)