Loose edge-connection of graphs
From MaRDI portal
Publication:6166663
DOI10.1007/s00373-023-02669-1zbMath1519.05138arXiv2206.11604MaRDI QIDQ6166663
Stanlislav Jendroľ, Ingo Schiermeyer, Christoph Brause
Publication date: 3 August 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11604
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Cites Work
- Proper connection of graphs
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
- Hardness and algorithms for rainbow connection
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
- On rainbow connection
- Conflict-free connections of graphs
- Odd connection and odd vertex-connection of graphs
- Rainbow connections of graphs: a survey
- From colourful to rainbow paths in graphs: colouring the vertices
- Rainbow connection and forbidden subgraphs
- Proper connection and size of graphs
- Facially-constrained colorings of plane graphs: a survey
- Looseness ranges of triangulations on closed surfaces
- Rainbow connection number and connected dominating sets
- Graphs with rainbow connection number two
- Rainbow connection in graphs
- Edge looseness of plane graphs
This page was built for publication: Loose edge-connection of graphs
