Conflict-free connection number of graphs with four bridges
From MaRDI portal
Publication:6045132
DOI10.1007/s00373-023-02649-5zbMath1514.05060OpenAlexW4365815340MaRDI QIDQ6045132
Publication date: 26 May 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02649-5
Cites Work
- Unnamed Item
- Conflict-free connections of graphs
- Conflict-free connection numbers of line graphs
- On conflict-free connection of graphs
- Graphs with conflict-free connection number two
- Conflict-free connection number and size of graphs
- Conflict-free connection of trees
- Hardness results for three kinds of colored connections of graphs
- Conflict-free (vertex)-connection numbers of graphs with small diameters
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
This page was built for publication: Conflict-free connection number of graphs with four bridges