WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Acta Mathematicae Applicatae Sinica
  2. Acta Mathematicae Applicatae Sinica : Volume 20
  3. Acta Mathematicae Applicatae Sinica : Volume 20, Issue 4, November 2004
  4. On 3-colorings of Plane Graphs
Loading...

Please wait, while we are loading the content...

Acta Mathematicae Applicatae Sinica : Volume 33
Acta Mathematicae Applicatae Sinica : Volume 32
Acta Mathematicae Applicatae Sinica : Volume 31
Acta Mathematicae Applicatae Sinica : Volume 30
Acta Mathematicae Applicatae Sinica : Volume 29
Acta Mathematicae Applicatae Sinica : Volume 28
Acta Mathematicae Applicatae Sinica : Volume 27
Acta Mathematicae Applicatae Sinica : Volume 26
Acta Mathematicae Applicatae Sinica : Volume 25
Acta Mathematicae Applicatae Sinica : Volume 24
Acta Mathematicae Applicatae Sinica : Volume 23
Acta Mathematicae Applicatae Sinica : Volume 22
Acta Mathematicae Applicatae Sinica : Volume 21
Acta Mathematicae Applicatae Sinica : Volume 20
Acta Mathematicae Applicatae Sinica : Volume 20, Issue 4, November 2004
Some Properties of A Lack-of-Fit Test for a Linear Errors in Variables Model
Detecting Change Points in Polynomial Regression Models with an Application to Cable Data Sets
The Inflated Attractors of Non–autonomous Strongly Damped Wave Equations
Predictor-Corrector Smoothing Methods for Monotone LCP
Qualitative Analysis for Rheodynamic Model of Cardiac Pressure Pulsations
A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs
Complexity of Reducing the Delay between Two Nodes by Node-based and Edge-based Upgrading Strategies
On 3-colorings of Plane Graphs
An Implementation for the Algorithm of Janet bases of Linear Differential Ideals in the Maple System
Ideal Systems and Connecting Orbits
Linear Volterra Integral Equations as the Limit of Discrete Systems
Distance Between Two Vertices of Maximum Matching Graphs
A Weighted Likelihood Ratio of Two Related Negative Hypergeomeric Distributions
Existence of Positive Solutions for Singular Second-orderm-Point Boundary Value Problems
Existence of Positive Solutions for a Class of Sigular Boundary Value Problem of Fourth Order
A Capital Asset Pricing Model Under Stable Paretian Distributions in a Pure Exchange Economy
Linear Secret Sharing Schemes and Rearrangements of Access Structures
On the Blow-up Criterion of Smooth Solutions to the 3D Ideal MHD Equations
A Converse Comparison Theorem for g-Expectations
Acta Mathematicae Applicatae Sinica : Volume 20, Issue 3, September 2004
Acta Mathematicae Applicatae Sinica : Volume 20, Issue 2, June 2004
Acta Mathematicae Applicatae Sinica : Volume 20, Issue 1, March 2004
Acta Mathematicae Applicatae Sinica : Volume 19
Acta Mathematicae Applicatae Sinica : Volume 18
Acta Mathematicae Applicatae Sinica : Volume 17
Acta Mathematicae Applicatae Sinica : Volume 16
Acta Mathematicae Applicatae Sinica : Volume 15
Acta Mathematicae Applicatae Sinica : Volume 14
Acta Mathematicae Applicatae Sinica : Volume 13

Similar Documents

...
A 3-color Theorem on Plane Graphs without 5-circuits

Article

...
A structural theorem on embedded graphs and its application to colorings

Article

...
On hamiltonian colorings of trees

Article

...
On hamiltonian colorings of block graphs

Article

...
Majority dominator colorings of graphs

Article

...
Circular colorings, orientations, and weighted digraphs

Article

...
Union vertex-distinguishing edge colorings

Article

...
Improved upper bounds on acyclic edge colorings

Article

...
Rank numbers for some trees and unicyclic graphs

Article

On 3-colorings of Plane Graphs

Content Provider Springer Nature Link
Author Xu, Bao gang
Copyright Year 2004
Abstract In this paper, we prove that if G is a plane graph without 4-, 5- and 7-circuits and without intersecting triangles, then for each face f of degree at most 11, any 3-coloring of the boundary of f can be extended to G. This gives a positive support to a conjecture of Borodin and Raspaud which claims that each plane graph without 5-circuits and intersecting triangles is 3-colorable.
Ending Page 604
Page Count 8
Starting Page 597
File Format PDF
ISSN 01689673
e-ISSN 16183932
Journal Acta Mathematicae Applicatae Sinica
Issue Number 4
Volume Number 20
Language English
Publisher Springer-Verlag
Publisher Date 2004-01-01
Publisher Place Berlin, Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword circuit Mathematical and Computational Physics coloring Graph labelling (graceful graphs, bandwidth, etc.) Applications of Mathematics Math Applications in Computer Science Coloring of graphs and hypergraphs Plane graph
Content Type Text
Resource Type Article
Subject Applied Mathematics
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
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
I will try my best to help you...
Cite this Content
Loading...