𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect 2-colorings of transitive cubic graphs

✍ Scribed by S. V. Avgustinovich; M. A. Lisitsyna

Book ID
114994277
Publisher
Pleiades Publishing
Year
2011
Tongue
English
Weight
515 KB
Volume
5
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cubic vertex-transitive graphs of order
Cubic vertex-transitive graphs of order 2pq
✍ Jin-Xin Zhou; Yan-Quan Feng πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 166 KB

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / ∈ S and S = {s -1 | s ∈ S}. The Cayley graph Cay(G, S) on G with respect to S

Fractional colorings of cubic graphs wit
Fractional colorings of cubic graphs with large girth
✍ KardoΕ‘, FrantiΕ‘ek; KrΓ‘l’, Daniel; Volec, Jan πŸ“‚ Article πŸ“… 2011 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 242 KB
On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
✍ ChΓ­nh T. HoΓ ng πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 409 KB πŸ‘ 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. Β© 1995 Joh