A study of 3-arc graphs

DOI10.1016/j.dam.2010.12.007zbMath1209.05134OpenAlexW2036551044MaRDI QIDQ628319

Sanming Zhou, Martin Knor, Guangjun Xu

Publication date: 10 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.007

zbMATH Keywords

independence numberchromatic numberdomination numberarc-coloring3-arc graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (4)

Hadwiger's conjecture for 3-arc graphs ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ Hamiltonicity of 3-arc graphs ⋮ Three-arc graphs: characterization and domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter and connectivity of 3-arc graphs
• On the arc-chromatic number of a digraph
• Some simplified NP-complete graph problems
• Finite symmetric graphs with two-arc transitive quotients
• Constructing a class of symmetric graphs
• Arc colorings of digraphs
• Almost covers of 2-arc transitive graphs
• On the characterization of path graphs
• CROSS RATIO GRAPHS
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
• Path graphs
• A class of finite symmetric graphs with 2-arc transitive quotients
• On the oriented chromatic index of oriented graphs
• Finite symmetric graphs with two‐arc transitive quotients II

This page was built for publication: A study of 3-arc graphs