Strongly proper connected coloring of graphs

DOI10.1007/s00026-023-00676-wMaRDI QIDQ6621951

Jarosław Grytczuk, Michał Dębski, Paweł Naroski, Małgorzata Śleszyńska-Nowak

Publication date: 21 October 2024

Published in: Annals of Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Coloring of graphs and hypergraphs (05C15) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Spanning trees: A survey
• The multi-tree approach to reliability in distributed networks
• On independent spanning trees
• Conflict-free connections of graphs
• Odd connection and odd vertex-connection of graphs
• Rainbow connections of graphs: a survey
• Nonrepetitive graph colouring
• A Theorem on Planar Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Rainbow connection in graphs
• Properly Colored Connectivity of Graphs
• Nonrepetitive colorings of graphs
• Recent progress on strong edge-coloring of graphs
• Trees in Polyhedral Graphs
• Non-separable and planar graphs.
• Über unendliche Zeichenreihen.
• Loose edge-connection of graphs
• On an estimate of the chromatic class of a \(p\)-graph

This page was built for publication: Strongly proper connected coloring of graphs