NDLI: Erdős–Gallai-type results for colorful monochromatic connectivity of a graph

Content Provider	Springer Nature Link
Author	Li, Xueliang Cai, Qingqiong Wu, Di
Copyright Year	2015
Abstract	A path in an edge-colored graph is called a monochromatic path if all the edges on the path are colored with one same color. An edge-coloring of G is a monochromatic connection coloring (MC-coloring, for short) if there is a monochromatic path joining any two vertices in G. For a connected graph G, the monochromatic connection number of G, denoted by mc(G), is defined to be the maximum number of colors used in an MC-coloring of G. These concepts were introduced by Caro and Yuster, and they got some nice results. In this paper, we study two kinds of Erdős–Gallai-type problems for mc(G), and completely solve them.
Ending Page	131
Page Count	9
Starting Page	123
File Format	PDF
ISSN	13826905
e-ISSN	15732886
Journal	Journal of Combinatorial Optimization
Issue Number	1
Volume Number	33
Language	English
Publisher	Springer US
Publisher Date	2015-07-22
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Erdős–Gallai-type problem Theory of Computation Coloring of graphs and hypergraphs Optimization Convex and Discrete Geometry MC-coloring Connectivity Extremal problems Mathematical Modeling and Industrial Mathematics Operation Research/Decision Theory Monochromatic connection number Combinatorics Monochromatic path Paths and cycles
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Control and Optimization Discrete Mathematics and Combinatorics Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Erd\H{o}s-Gallai-type results for colorful monochromatic connectivity of a graph

Erd\H{o}s-Gallai-type results for total monochromatic connection of graphs

Some extremal results on the colorful monochromatic vertex-connectivity of a graph

Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs

Monochromatic disconnection: Erd\H{o}s-Gallai-type problems and product graphs

Proper connection number and 2-proper connection number of a graph

First-Fit colorings of graphs with no cycles of a prescribed even length

Erd\"os-Gallai-type results for conflict-free connection of graphs

Conflict-free connection numbers of line graphs

Erdős–Gallai-type results for colorful monochromatic connectivity of a graph

Similar Documents

Erd\H{o}s-Gallai-type results for colorful monochromatic connectivity of a graph

Erd\H{o}s-Gallai-type results for total monochromatic connection of graphs

Some extremal results on the colorful monochromatic vertex-connectivity of a graph

Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs

Monochromatic disconnection: Erd\H{o}s-Gallai-type problems and product graphs

Proper connection number and 2-proper connection number of a graph

First-Fit colorings of graphs with no cycles of a prescribed even length

Erd\"os-Gallai-type results for conflict-free connection of graphs

Conflict-free connection numbers of line graphs

Erdős–Gallai-type results for colorful monochromatic connectivity of a graph