[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Collins et al., 2014 - Google Patents

Constructing graphs with no immersion of large complete graphs

Collins et al., 2014

View PDF
Document ID
13959839469812803325
Author
Collins K
Heenehan M
Publication year
Publication venue
Journal of Graph Theory

External Links

Snippet

Abstract In 1989, Lescure and Meyniel proved, for, that every d‐chromatic graph contains an immersion of, and in 2003 Abu‐Khzam and Langston conjectured that this holds for all d. In 2010, DeVos, Kawarabayashi, Mohar, and Okamura proved this conjecture for. In each …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition

Similar Documents

Publication Publication Date Title
Chang et al. Antimagic labeling of regular graphs
Arshad et al. Some common fixed point results in rectangular metric spaces
Dvořák et al. Star chromatic index
Kim et al. A note on a Brooks' type theorem for DP‐coloring
King Hitting all maximum cliques with a stable set using lopsided independent transversals
Cheng et al. Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
Chang et al. Strong chromatic index of 2‐degenerate graphs
Kim et al. Counterexamples to the list square coloring conjecture
Chudnovsky et al. Induced subgraphs of graphs with large chromatic number. XII. Distant stars
Fomin et al. Strengthening Erdös–Pósa property for minor‐closed graph classes
Fiorini et al. A tighter Erdős‐Pósa function for long cycles
Cutler et al. The maximum number of complete subgraphs of fixed size in a graph with given maximum degree
Dorbec et al. Independent domination in cubic graphs
Hertz et al. Dominating induced matchings in graphs containing no long claw
Collins et al. Constructing graphs with no immersion of large complete graphs
Albar et al. On triangles in‐minor free graphs
Bubeck et al. On the local profiles of trees
Barrus et al. Colored saturation parameters for rainbow subgraphs
Letzter et al. The homomorphism threshold of‐free graphs
Kim et al. Improper coloring of sparse graphs with a given girth, II: constructions
Gerbner On Turán problems with bounded matching number
Axenovich et al. Conditions on Ramsey nonequivalence
Harding et al. Gallai's conjecture for graphs of girth at least four
Nikoghosyan Disconnected forbidden subgraphs, toughness and Hamilton cycles
Chen et al. An (F 1, F 4)‐partition of graphs with low genus and girth at least 6