𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement

✍ Scribed by Johannes H. Hattingh, Ossama A. Saleh, Lucas C. van Der Merwe, Terry J. Walters

Book ID
118792087
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2012
Tongue
English
Weight
201 KB
Volume
28
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal graphs for the list-coloring ve
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
✍ Simone Dantas; Sylvain Gravier; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 215 KB

We characterize the graphs G such that Ch(G) + Ch( G) = n + 1, where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices.

The minimum number of subgraphs in a gra
The minimum number of subgraphs in a graph and its complement
✍ Lane Clark πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 265 KB πŸ‘ 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent